2 ms·
Wikipedia gives an example merge sort that does nearly exactly what you describe. That algorithm has some weird performance drops at 2^n+1 sorted elements. htt
by bediger4000 2y ago
Wikipedia gives an example merge sort that does nearly exactly what you describe.
That algorithm has some weird performance drops at 2^n+1 sorted elements. https://bruceediger.com/posts/mergesort-investigation-8/ https://bruceediger.com/posts/mergesort-investigation-8/
- deleted 2y ago[deleted]