A Question of Sorts

Published December 24, 2019 by GameDev.net
Do you see issues with this article? Let us know.
Advertisement
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
Cancel Save
0 Likes 0 Comments

Comments

Nobody has left a comment. You can be the first!
You must log in to join the conversation.
Don't have a GameDev.net account? Sign up!

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
Advertisement