On Thursday, 9 July 2015 at 21:57:39 UTC, Xinok wrote:
I found this paper which describes an in-place algorithm with O(n) time complexity but it's over my head at the moment.http://link.springer.com/article/10.1007%2FBF01994842
I apologize, I didn't realize this link was behind a paywall. The paper is freely available here:
http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.25.5554&rep=rep1&type=pdf
