Timeline for Natural merge sort in Java
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 30, 2015 at 20:29 | comment | added | Marko Topolnik |
Calculating runs is O(n) and after that performance depends on the degree of pre-sorting in the array. Therefore this algo can win at most the log n part of plain mergesort's O(n logn). It can pay off well for almost sorted input. The overheads of involving the queues should also be considered.
|
|
| Dec 1, 2014 at 4:08 | vote | accept | coderodde | ||
| S Dec 1, 2014 at 0:30 | history | suggested | TheCoffeeCup | CC BY-SA 3.0 |
fixed grammar and added `
|
| Dec 1, 2014 at 0:23 | review | Suggested edits | |||
| S Dec 1, 2014 at 0:30 | |||||
| Nov 30, 2014 at 21:36 | history | answered | vnp | CC BY-SA 3.0 |