一、冒泡排序
public class ArraySortStudy { public static void main(String[] args) { int arr[] = {1, 8, 7, 4}; //冒泡排序算法 for (int i = 0; i < arr.length; i++) { for (int j = 0; j < arr.length; j++) { if(arr[i]<arr[j]){ int temp = arr[i]; arr[i]=arr[j]; arr[j]=temp; } } } for (int a : arr) { System.out.println(a); } } }
二、选择排序
public class ArraySortStudy { public static void main(String[] args) { int arr[] = {1, 8, 7, 4}; //选择排序 int min = 0; for (int i = 0; i < arr.length; i++) { min = i; for (int j = i + 1; j < arr.length; j++) { if (arr[min] > arr[j]) { min = j; } } if (i != min) { int temp = arr[i]; arr[i] = arr[min]; arr[min] = temp; } } for (int a : arr) { System.out.println(a); } } }
三、快速排序
public class ArraySortStudy { public static void main(String[] args) { int arr[] = {1, 8, 7, 4}; //快速排序 for (int i = 1; i < arr.length; i++) { int temp = arr[i]; int j = i; while (j>0&&temp<arr[j-1]){ arr[j]=arr[j-1]; j--; } arr[j] =temp; } for (int a : arr) { System.out.println(a); } } }