reneargento/algorithms-sedgewick-wayne

2.2.17 Natural Mergesort for Linked List

ckwastra opened this issue · 1 comments

It seems to be the same problem as in #101. The algorithm always merges the first sorted subarray with the second sorted subarray, resulting in the time complexity of $O(N^2)$.

Yes, the natural mergesort for linked lists had the same issue.
It is updated now: 66b23a3
Thanks!