java 实现快速排序
1 public static int partition(int[] a, int f, int b) { 2 int pivot = a[f]; 3 while (f < b) { 4 while (f < b && a[b] >= pivot) { 5 b--; 6 } 7 while (f < b && a[f] < pivot) { 8 f++; 9 } 10 if (f < b) { 11 int tmpB = a[b]; 12 a[b] = a[f]; 13 a[f] = tmpB; 14 } 15 } 16 return b; 17 } 18 19 public static void quickSort(int[] a, int f, int b) { 20 if (f < b) { 21 int division = partition(a, f, b); 22 quickSort(a, f, division); 23 quickSort(a, division + 1, b); 24 } 25 }
1 public static int partition(int[] a, int f, int b) { 2 int pivot = a[f]; 3 while (f < b) { 4 while (f < b && a[b] >= pivot) { 5 b--; 6 } 7 while (f < b && a[f] < pivot) { 8 f++; 9 } 10 if (f < b) { 11 int tmpB = a[b]; 12 a[b] = a[f]; 13 a[f] = tmpB; 14 } 15 } 16 return b; 17 } 18 19 public static void quickSort(int[] a, int f, int b) { 20 if (f < b) { 21 int division = partition(a, f, b); 22 quickSort(a, f, division); 23 quickSort(a, division + 1, b); 24 } 25 }
如今的编程是一场程序员和上帝的竞赛,程序员要开发出更大更好、傻瓜都会用到软件。而上帝在努力创造出更大更傻的傻瓜。目前为止,上帝是赢的。
QQ:6203142
-----在北京的四川小伙