• Welcome to Computer Association of SIUE - Forums.
 

Sorting Algorithms

Started by Tyler, 2006-11-16T09:34:42-06:00 (Thursday)

Previous topic - Next topic

Tyler

Check out the sweet sorting algorithms with visualizations.

Here
Retired CAOS Officer/Overachiever
SIUE Alumni Class of 2005

Ross Mead

LOL!  I know that martins would be interested in this; he has/had a CS240 exam today, and was reviewing sorts with me all last night! :-P

Shaun Martin

This would have been VERY useful if you had posted this last night!

It's all good though.  I rocked that test.  Also, I noticed that it said that quick sort was the quickest algorithm; however, in a worst case scenario merge sort is quicker since it is always O(nlogn) and quick sort in the worst case is O(n^2) depending on where the pivots are.  :-D
Shaun Martin
SIUE Alumni
Associate IT Analyst, AT&T Services, Inc. St. Louis, MO.

raptor

sorting is for boring people...i like to use a random number generator to pick what index i'll check in my array of items...keeps things interesting :-?
President of CAOS
Software Engineer NASA Nspires/Roses Grant

Bryan

sor-ting  al-go-rithm?


I have a vague memory of learning these.  now i just get to use vague terms like "take your time" "very fast"  and "warp speed"
Bryan Grubaugh
Quickly aging alumni with too much time on his hands
Business Systems Analyst, Scripps Networks.