Talk:Tree sort

From Wikipedia, the free encyclopedia

	This article is within the scope of WikiProject Computer science, which aims to create a comprehensive computer science reference for Wikipedia. Visit the project page for more information and to join in on related discussions.
Stub	rated as Stub-Class on the assessment scale
???	This article has not yet received an importance rating on the assessment scale.

[edit] Merge and Redirect to Binary Search Tree

I would suggest merging and redirecting Tree sort to binary search tree. The information on Tree sort is already covered in binary search tree under the Operations section. It seems unnecessary to have a separate entry for this topic. 300user (talk) 04:57, 13 February 2008 (UTC)

[edit] Big O Notation

After looking up this page, I noticed the article does not discuss speed, so I asked my professor. He told me it was O(n log n) so I put that in the article. After playing with the code myself, it seems to me to be more like O(n) - I'm going to defer to him and leave the main page as is, but if someone with more knowlege of algorithm speed knows exactly how fast tree sort runs would like to double check me and my professor, I'd appreciate it.