1 冒泡排序
public class BubbleSort { public static void main(String[] args) { int [] arr = new int[] {2,5,12,8,23,90,34}; sort(arr); Arrays.stream(arr).forEach(x->System.out.print(x+ " ")); } public static void sort(int [] arr) { for(int j = arr.length-1 ; j>0;j--) { for(int i = 0 ; i<j; i++) { if(arr[i] > arr[i+1]) { swap(arr, i, i+1); } } } } public static void swap(int [] arr , int i , int j) { int temp = arr[i]; arr[i] = arr[j]; arr[j] = temp; } }
2 选择排序
public class SelectionSort { public static void main(String[] args) { int [] arr = new int[] {2,5,12,8,23,90,34}; sort(arr); Arrays.stream(arr).forEach(x->System.out.print(x+ " ")); } public static void sort(int [] arr ) { for(int i=0 ; i<arr.length; i++) { int min = i; for(int j=i+1;j<arr.length;j++) { min = arr[j]<arr[min]?j:min; } swap(arr, min, i); } } public static void swap(int [] arr , int i , int j) { int temp = arr[i]; arr[i] = arr[j]; arr[j] = temp; } }
3 插入排序
public class InsertSort { public static void main(String[] args) { int [] arr = new int[] {2,5,12,8,23,90,34}; sort(arr); Arrays.stream(arr).forEach(x->System.out.print(x+ " ")); } public static void sort(int [] arr ) { for(int i=1;i<arr.length;i++) { int j=i; while(j>0 ) { if( arr[j] < arr[j-1]) { swap(arr,j,j-1); } j--; } } } public static void swap(int [] arr , int i , int j) { int temp = arr[i]; arr[i] = arr[j]; arr[j] = temp; } }
4 归并排序
public class MergeSort { public static void main(String[] args) { int [] arr = new int[] {2,5,12,8,23,90,34}; sort(arr, 0 , arr.length-1); Arrays.stream(arr).forEach(x->System.out.print(x+ " ")); } public static void sort(int[] arr , int L , int R) { if(L == R) { return ; } int mid = L+((R-L)>>1); sort(arr,L,mid); sort(arr,mid+1,R); merge(arr,L,mid,R); } private static void merge(int [] arr, int L, int mid, int R) { int [] help = new int[R-L+1]; int i = 0; int p1 = L; int p2 = mid+1; while(p1<=mid && p2<= R) { help[i++] = arr[p1] < arr[p2] ? arr[p1++]:arr[p2++]; } while(p1<=mid) { help[i++] = arr[p1++]; } while(p2<=R) { help[i++] = arr[p2++]; } for(i= 0 ; i<help.length; i++ ) { arr[L+i] = help[i]; } } }
5 随机快速
/** * 经典快排:每次取都是最后一个数做参考 * 随机快排:每次随机取一个数和最后一个数交换后,再排序 * 经典快排思路:每次取数组的最后一个数num为参照,将指定区域排序为,前半部分小于num,中间部分等于num,右半部分大于num,递归调用 */ public class QuickSort { public static void main(String[] args) { int[] arr = new int[] { 2, 5, 12, 8, 6, 90, 34, 10, 10 }; sort(arr, 0, arr.length - 1); Arrays.stream(arr).forEach(x -> System.out.print(x + " ")); } public static void sort(int[] arr, int L, int R) { if (L < R) { //随机选择一个数和最后一个数交换 swap(arr, L + (int)(Math.random()*(R-L+1)), R); int[] p = partion(arr, L, R); sort(arr, L, p[0] - 1); sort(arr, p[1] + 1, R); } } public static int[] partion(int[] arr, int L, int R) { int less = L - 1; int more = R; int cur = L; while (cur < more) { if (arr[cur] < arr[R]) { swap(arr, cur++, ++less); } else if (arr[cur] == arr[R]) { cur++; } else { // 假如arr[R]是10,这里交换后,more位置要比10大 swap(arr, cur, --more); } } // 交换后,more位置一定是等于区域的最后一个 swap(arr, R, more); return new int[] { less + 1, more }; } public static void swap(int[] arr, int i, int j) { int temp = arr[i]; arr[i] = arr[j]; arr[j] = temp; } }