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
🎉 Celebrating 25 Years of GameDev.net! 🎉
Not many can claim 25 years on the Internet! Join us in celebrating this milestone. Learn more about our history, and thank you for being a part of our community!
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