198 |
|
* @param lo the index of the first element in the range to be sorted |
199 |
|
* @param hi the index after the last element in the range to be sorted |
200 |
|
* @param start the index of the first element in the range that is |
201 |
< |
* not already known to be sorted (@code lo <= start <= hi} |
201 |
> |
* not already known to be sorted ({@code lo <= start <= hi}) |
202 |
|
*/ |
203 |
|
@SuppressWarnings("fallthrough") |
204 |
|
private static void binarySort(Object[] a, int lo, int hi, int start) { |
266 |
|
* @param a the array in which a run is to be counted and possibly reversed |
267 |
|
* @param lo index of the first element in the run |
268 |
|
* @param hi index after the last element that may be contained in the run. |
269 |
< |
It is required that @code{lo < hi}. |
269 |
> |
It is required that {@code lo < hi}. |
270 |
|
* @return the length of the run beginning at the specified position in |
271 |
|
* the specified array |
272 |
|
*/ |