摘要：
单向冒泡排序void BubbleSort(int Iarray[], int n){ int i = 0, j = 0; int flag = 1; for (i = 0; i < n - 1; i++) { flag = 1; for (j = 0; j < n - i - 1; j++) { if(Iarray[i] > Iarray[i+1]) { int temp = 0; temp = Iarray[j]; Iarray[j] = Iarray[j+1]; Ia... 阅读全文
