【算法】【冒泡排序】

int main() { int arr[] = {3,6,4,2,11,10,5}; int i = 0, j = 0 ; int len = sizeof(arr)/sizeof(arr[0]); int temp = 0; for(i=0; i<len; i++){ for(j=i; j< len; j++){ if(arr[i]>arr[j]){ temp =

>>阅读原文<<