News for hackers. Stuff that matters.
Re:O(n^2), again, now in Windows Management Instrumentation by sterlind on Monday December 09, 2019 @05:39PM (#21747437)
You could also go with radix sort (O(N)), since your insertion times are presumably some kind of integer.
Re:O(n^2), again, now in Windows Management Instrumentation by ww520 on Monday December 09, 2019 @08:26PM (#21748743)
Yes, radix is faster. But at that point I was looking for stability and simplicity over all else. Merge sort was stable and simple to implement, with decent performance.