A friendly place for programming greenhorns!
Big Moose Saloon
Register / Login
Win a copy of
Refactoring for Software Design Smells: Managing Technical Debt
this week in the
OO, Patterns, UML and Refactoring
Heap Sort and Quick Sort
Joined: Jan 06, 2006
Feb 05, 2006 15:48:00
Could someone give me an example where quick sort will be better than heap sort.
Joined: Aug 31, 2004
Feb 05, 2006 17:34:00
You might find Wikipedia's
interesting. There's a section that compares it (in general terms) to quick sort.
"We're kind of on the level of crossword puzzle writers... And no one ever goes to them and gives them an award."
I’ve looked at a lot of different solutions, and in my humble opinion Aspose is the way to go. Here’s the link:
subject: Heap Sort and Quick Sort
Quicksort vs Merge Sort
When which is better - Heap Sort or Quick Sort
All times are in JavaRanch time: GMT-6 in summer, GMT-7 in winter
| Powered by
Copyright © 1998-2015