equal
deleted
inserted
replaced
194 /** |
194 /** |
195 * March over the array once, left to right, finding natural runs, |
195 * March over the array once, left to right, finding natural runs, |
196 * extending short natural runs to minRun elements, and merging runs |
196 * extending short natural runs to minRun elements, and merging runs |
197 * to maintain stack invariant. |
197 * to maintain stack invariant. |
198 */ |
198 */ |
199 TimSort<T> ts = new TimSort<T>(a, c); |
199 TimSort<T> ts = new TimSort<>(a, c); |
200 int minRun = minRunLength(nRemaining); |
200 int minRun = minRunLength(nRemaining); |
201 do { |
201 do { |
202 // Identify next run |
202 // Identify next run |
203 int runLen = countRunAndMakeAscending(a, lo, hi, c); |
203 int runLen = countRunAndMakeAscending(a, lo, hi, c); |
204 |
204 |