Java快速排序实现如下 public class QuickSort { public static int partition(int[] arr, int low, int high) { int pivot = arr[high]; int point = low; for (int i = low; i < high; i++) { if (arr[i] <= pivot) { int temp = arr[i]; arr[i] = arr[point]; arr[point] = temp; point++; } } int temp = arr[high]; arr[high] = arr[point]; arr[point] = temp; return point; } //递归分别进行高低分段排序 public static void quickSort(int[] arr, int low, int high) { if (low < high) { int point = partition(arr, low, high); quickSort(arr, low, --point); quickSort(arr, ++point, high); } } public static void main(String[] args) { int[] arr = {12, 55, 2, 77, 57, 35, 78, 23, 89, 43, 32}; quickSort(arr, 0, arr.length - 1); System.out.println(Arrays.toString(arr)); } }
快速排序算法Java实现
最新推荐文章于 2024-07-15 22:27:12 发布