269 |
|
*/ |
270 |
|
int n = start - left; // The number of elements to move |
271 |
|
// Switch is just an optimization for arraycopy in default case |
272 |
< |
switch(n) { |
272 |
> |
switch (n) { |
273 |
|
case 2: a[left + 2] = a[left + 1]; |
274 |
|
case 1: a[left + 1] = a[left]; |
275 |
|
break; |
313 |
|
|
314 |
|
// Find end of run, and reverse range if descending |
315 |
|
if (c.compare(a[runHi++], a[lo]) < 0) { // Descending |
316 |
< |
while(runHi < hi && c.compare(a[runHi], a[runHi - 1]) < 0) |
316 |
> |
while (runHi < hi && c.compare(a[runHi], a[runHi - 1]) < 0) |
317 |
|
runHi++; |
318 |
|
reverseRange(a, lo, runHi); |
319 |
|
} else { // Ascending |