Bubble Sort in C: Code Implementation

The bubble sort is a simple sorting algorithm that repeatedly traverses the array to be sorted, comparing pairs of elements and swapping them if they are in the wrong order. Below is the C language code to implement the bubble sort algorithm:

#include <stdio.h>

void bubbleSort(int arr[], int n) {
    int i, j, temp;
    for (i = 0; i < n-1; i++) {
        for (j = 0; j < n-i-1; j++) {
            if (arr[j] > arr[j+1]) {
                // 交换位置
                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]);
    }
    printf("\n");
    
    return 0;
}

In the code above, we have defined a bubbleSort function to implement the bubble sort algorithm. Then in the main function, we have defined an integer array arr and called the bubbleSort function to sort the array. Finally, we output the sorted array.