冒泡排序(C语言)

代码如下:

#include

//Declaration Function
void TraverseArr(int arr[], int len);
void swap(int* a, int* b);
void BubbleSort(int arr[], int len);

// The Main Entrance of the Program
int main(int args, char const *argv[]) { 
    int arr[] ={5,3,4,1,2};
    int len = sizeof(arr)/sizeof(int);
    printf("len = %-4dn", len);
    printf("Before Sorting: ");
    TraverseArr(arr, len);
    BubbleSort(arr, len);
    printf("After Sorting: ");
    TraverseArr(arr, len);

    return 0;
}


void TraverseArr(int arr[], int len) {
    for (int i = 0; i < len; i++) {
      printf("%-4d", arr[i]);
    }
    printf("n");
    return;
}


void BubbleSort(int arr[], int len){
    for(int i = 0; i < len-1; i += 1){
        for(int j = 0; j < len - 1 - i; ++j){
            if(arr[j] > arr[j + 1]){
                swap(&arr[j], &arr[j + 1]);
            }
        }
    }
    return;
}


void swap(int *a, int *b) {
    int temp = *a;
    *a = *b;
    *b = temp;
    return;
}

运行结果如下: