用C语言写一个冒泡排序算法

。

Sure, here's an implementation of bubble sort in C:

#include <stdio.h>

void bubbleSort(int arr[], int n) {
  int i, j;
  for (i = 0; i < n-1; i++) {
    for (j = 0; j < n-i-1; j++) {
      if (arr[j] > arr[j+1]) {
        int temp = arr[j];
        arr[j] = arr[j+1];
        arr[j+1] = temp;
      }
    }
  }
}

int main() {
  int arr[] = {64, 34, 25, 12, 22, 11, 90};
  int n = sizeof(arr)/sizeof(arr[0]);
  bubbleSort(arr, n);
  printf("Sorted array: \n");
  for (int i=0; i < n; i++)
    printf("%d ", arr[i]);
  return 0;
}

This code sorts an array of integers using the bubble sort algorithm. The `bubbleSort` function takes an array `arr` and its size `n` as input and sorts the array in ascending order. In the `main` function, an array of integers is created and its size is calculated, then the `bubbleSort` function is called to sort the array. Finally, the sorted array is printed to the screen.