|
Lines 677-683
Link Here
|
| 677 |
public static void reverseQuickSort(char[][] list, int left, int right) { |
677 |
public static void reverseQuickSort(char[][] list, int left, int right) { |
| 678 |
int original_left= left; |
678 |
int original_left= left; |
| 679 |
int original_right= right; |
679 |
int original_right= right; |
| 680 |
char[] mid= list[(right + left) / 2]; |
680 |
char[] mid= list[(right + left) >>> 1]; |
| 681 |
do { |
681 |
do { |
| 682 |
while (CharOperation.compareTo(list[left], mid) > 0) { |
682 |
while (CharOperation.compareTo(list[left], mid) > 0) { |
| 683 |
left++; |
683 |
left++; |
|
Lines 702-709
Link Here
|
| 702 |
} |
702 |
} |
| 703 |
public static void reverseQuickSort(char[][] list, int left, int right, int[] result) { |
703 |
public static void reverseQuickSort(char[][] list, int left, int right, int[] result) { |
| 704 |
int original_left= left; |
704 |
int original_left= left; |
| 705 |
int original_right= right; |
705 |
int original_right= right; |
| 706 |
char[] mid= list[(right + left) / 2]; |
706 |
char[] mid= list[(right + left) >>> 1]; |
| 707 |
do { |
707 |
do { |
| 708 |
while (CharOperation.compareTo(list[left], mid) > 0) { |
708 |
while (CharOperation.compareTo(list[left], mid) > 0) { |
| 709 |
left++; |
709 |
left++; |
