linux.wku.edu— This is a great resource for source code for different sorting algorithms. It also graphs performance of each algorithm to help you choose the best one to use. The code is all in C.
Feb 19, 2006View in Crawl 4
Brings back memories of good ol' E.W. Dijkstra, and his algorithm that was the engine for my final year project - A journey planner for the London Underground!
For those saying that Quicksort is slow in the worst case, that's why you use a randomized pivot selection. Sure, it'll still run slowly if you manage to randomly select the wrong pivot every time, but that's not very likely.
Oh, and I just read according to for instance quicksort:"Recursion, advanced data structures, multiple arrays - these algorithms make extensive use of those nasty things."No. It uses recursion, but no advanced data structures (whatever that is) or multiple arrays (can you keep two things in your head, dumb*ss?)Seriously. If you have a hard time understanding recursion, stay the hell out of programming.
pls any one can give serious reply, no joking, is there any sorting mothod faster than qsort and handles any size of data. if so what is that, why it is not spoken about?.because i have a method which handle any size of data with any data type ie byte int string of large size.pls comment
volatileacidFeb 19, 2006
Brings back memories of good ol' E.W. Dijkstra, and his algorithm that was the engine for my final year project - A journey planner for the London Underground!
antechronosFeb 19, 2006
For those saying that Quicksort is slow in the worst case, that's why you use a randomized pivot selection. Sure, it'll still run slowly if you manage to randomly select the wrong pivot every time, but that's not very likely.
operaFeb 20, 2006
Oh, and I just read according to for instance quicksort:"Recursion, advanced data structures, multiple arrays - these algorithms make extensive use of those nasty things."No. It uses recursion, but no advanced data structures (whatever that is) or multiple arrays (can you keep two things in your head, dumb*ss?)Seriously. If you have a hard time understanding recursion, stay the hell out of programming.
z_manFeb 20, 2006
hmm thanks, i might use one of those
durinthalFeb 20, 2006
I'm with gumbystation on this one.. could've used it for my homework a couple of weeks back.
dmh2000Feb 20, 2006
here's a different sorting visualization. it shows the 'dynamics' of how the data moves around in the various algorithms. You can use it to see the degenerate qsort case if you pick 'ordered' and 'qsort'. it requires java 1.2 or later. It really shows the difference between bubble sort and the other sorts.<a class="user" href="http://dmh2000.com/datastruct/sortingdynamics.shtml">http://dmh2000.com/datastruct/sortingdynamics.shtml</a>
quasipalmJun 7, 2006
Check this site out for more free and open source code:<a class="user" href="http://www.codecodex.com/">http://www.codecodex.com/</a>
shivssbFeb 17, 2007
pls any one can give serious reply, no joking, is there any sorting mothod faster than qsort and handles any size of data. if so what is that, why it is not spoken about?.because i have a method which handle any size of data with any data type ie byte int string of large size.pls comment