Which is faster on the same data; an O(n) sort or an O(nLog(n)) sort? Answer: It depends. It depends on the amount of data being sorted, on the hardware its being run on, and on the implementation of the algorithms. This article is an exploration of sorting implementations and their performance characteristics.
http://seven-degrees-of-freedom.blogspot.com/2010/07/question-of-sorts.html
Which is faster on the same data; an O(n) sort or an O(nLog(n)) sort? Answer: It depends. It depends on the amount of data being sorted, on the hardware its being run on, and on the implementation of the algorithms. This article is an exploration of sorting implementations and their performance characteristics.
Advertisement
Recommended Tutorials
Other Tutorials by GameDev.net
Advertisement