Sorting algorithms/Merge sort: Difference between revisions
Content added Content deleted
| Line 3,433: | Line 3,433: | ||
let ia = 0, il = 0, ir = 0 |
let ia = 0, il = 0, ir = 0 |
||
while (il < left.length && ir < right.length) |
while (il < left.length && ir < right.length) |
||
a[ia++] = |
a[ia++] = left[il] < right[ir] ? left[il++] : right[ir++] |
||
while (il < left.length) |
while (il < left.length) |
||
a[ia++] = left[il++] |
a[ia++] = left[il++] |
||