Page 1 of 1
WHat is the best heapsort
Posted: Sat Feb 18, 2006 1:41 pm
by Jalal
As far i know carlsson's heap sort algorithm is the best for heapsort even better than corman. Is there any better than carlsson and what is the complexity of that for number of comparisons
AM i alright?
Posted: Tue Feb 21, 2006 10:45 am
by Jalal
I have working on Heapsort for my undergrad thesis.
I derived a new heapsort thats complexity is nlogn + nloglogn - n
where as the carlsson has nlongn + nloglogn
As far i know that was the best heapsort. If so then my one is better than
carlsson. Plz anyone let me know that i m alright................
Posted: Mon Mar 27, 2006 12:43 pm
by david
Considering the standard heapsort algorithm has complexity O(n log n), and furthermore this cannot be improved upon, I have no clue what you may be talking about.