int[] myArray = new int[] { 135, 344, 239, 1283, 675, 449, 203, 536, 667 }; //比较一趟就是跟后面的每个数来进行比较 for (int i = 0; i < myArray.Length; i++) { for (int j = i + 1; j < myArray.Length; j++) { // 当前面一个数比后面大时,则两个数互换位置(即myArray[i]>myArray[i+1]) if (myArray[i] > myArray[j]) { int temp = 0; temp = myArray[i]; myArray[i] = myArray[j]; myArray[j] = temp; } } } 冒泡排序是一个下沉的排序,也就是大数沉,小数浮,那么反过来,从大到小排序则可以如下实现: int[] myArray = new int[] { 135, 344, 239, 1283, 675, 449, 203, 536, 667 }; //比较一趟就是跟后面的每个数来进行比较 for (int i = 0; i < myArray.Length; i++) { for (int j = i + 1; j < myArray.Length; j++) { // 当前面一个数比后面大时,则两个数互换位置(即myArray[i]>myArray[i+1]) if (myArray[i] < myArray[j]) { int temp = 0; temp = myArray[i]; myArray[i] = myArray[j]; myArray[j] = temp; } } }