三大经典排序

冒泡排序

int[]arr = {5,8,6,7};for(int i = 0;i<arr.length-1;i++) {for(int j = 0;j<arr.length-1-i;j++) {if(arr[j]>arr[j+1]) {int temp = arr[j+1];arr[j+1] = arr[j];arr[j] = temp;}}}

选择排序

int[]arr = {5,8,6,7};for (int i = 0; i < arr.length-1; i++) {int index = 0;//设置下标for (int j = 0; j < arr.length-i; j++) {if (arr[j]>arr[index]) {index = j;//获取大数的下标}}//把最大的数放到最后一位int temp = arr[arr.length-i-1];arr[arr.length-i-1] = arr[index];arr[index] = temp;}

插入排序

int[]arr = {5,8,6,7};for (int i = 1; i < arr.length; i++) {for (int j = i; j >0; j--) {if(arr[j]<arr[j-1]) {int temp = arr[j-1];arr[j-1] = arr[j];arr[j] = temp;}else {break;}}}