C 经典 冒泡排序

#include <stdio.h>

int main(int argc, const char * argv[])
{

    //
    void maopao(int arr[], int len);

    int arr[] = {1,2,32,22,64,212,221,323,224,11};

    int len = sizeof(arr)/sizeof(int);

    maopao(arr, len);

    for (int i = 0; i < len - 1; i ++) {
        printf("%d\t", arr[i]);
    }

    printf("\n");
    return 0;
}

void maopao(int arr[], int len){
    for (int i = 0; i < len - 1; i ++) {
        for (int j = 0; j < len - 1 - i; j ++) {
            if (arr[j] > arr[j+1]) {
                arr[j] = arr[j] ^ arr[j+1];
                arr[j + 1] = arr[j] ^ arr[j+1];
                arr[j] = arr[j] ^ arr[j+1];

            }
        }
    }


}