冒泡排序

#include <stdio.h>#include <windows.h>#include <assert.h>#include <string.h>void swap(int *x,int *y){*x ^= *y;*y ^= *x;*x ^= *y;}void print_printf(int *arr,int len){int k = 0;for(k=0; k<len; k++){printf("%d ",arr[k]);}printf("\n");}int main(){int arr[]={1,4,6,9,41,8,24};int i = 0;int j = 0;int len = sizeof(arr)/sizeof(sizeof(arr[0]));int max = arr[0];for(i=0; i<len; i++){for(j=0; j<len - 1; j++){if(arr[j]>arr[j+1]){swap(&arr[j],&arr[j+1]);}}}    print_printf(arr,len);system("pause");return 0;}