Ager
幸运之矛
摘要: /* 冒泡排序 arr 要排序的数组 length 数组长度*/int* bubbleSort(int arr[],int length){ for (int i = 0;i arr[j+1]){ int num = arr[j]; arr[j] = arr[j+1]; arr[j + 1] = ... 阅读全文
posted @ 2015-09-09 12:44 D.Angelo 阅读(234) 评论(0) 推荐(0)