Skip to main content
GameDev.net gamedev.net

PRO Tired of ads? Read GameDev.net ad-free and help keep the community independent with GameDev Pro — $3/month.

A Question of Sorts
External Resource

A Question of Sorts

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.

GameDev.net
GameDev.net
December 24, 2019 4.7k views

This tutorial is hosted externally

http://seven-degrees-of-freedom.blogspot.com/2010/07/question-of-sorts.html

Visit Tutorial

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.

Related Tutorials

Discussion

Discussion

Loading comments...

More from GameDev.net