Tuesday, May 12, 2015

Merge sort linked list

Merge sort, compared to quick sort has the best and worst time complexity of O(NLgN) and requires O(N) space.

However for linked list, merge sort doesn't require additional space.

Posted by at

No comments:

Post a Comment

Subscribe to: Post Comments (Atom)