Algorithm Problem: In-Place Merge Sort

By | 2012 年 12 月 25 日

The original merge sort version will take O(n) space, and O(nlogn) time.

The O(n) space is the most significant problem of this algorithm. However, there is an O(1) space version, called ‘in-place merge sort’.

This article described this version clearly: http://blog.ibread.net/345/in-place-merge-sort/

发表评论

电子邮件地址不会被公开。 必填项已用*标注