Print Page - Sorting Algorithms

Title: Sorting Algorithms
Post by: Tyler on 2006-11-16T09:34:42-06:00 (Thursday)

Check out the sweet sorting algorithms with visualizations.

Here (http://www.cs.ubc.ca/spider/harrison/Java/sorting-demo.html)

Title: Re: Sorting Algorithms
Post by: Ross Mead on 2006-11-16T10:30:50-06:00 (Thursday)

LOL! I know that martins (http://caos.siue.edu/userinfo.php?uid=422) would be interested in this; he has/had a CS240 exam today, and was reviewing sorts with me all last night! :-P

Title: Re: Sorting Algorithms
Post by: Shaun Martin on 2006-11-16T11:26:05-06:00 (Thursday)

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

Title: Re: Sorting Algorithms
Post by: raptor on 2006-11-16T11:29:47-06:00 (Thursday)

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 :-?

Title: Re: Sorting Algorithms
Post by: Bryan on 2006-11-17T13:50:28-06:00 (Friday)

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"

Computer Association of SIUE - Forums

CAOS Forums => Technical Knowledge => Topic started by: Tyler on 2006-11-16T09:34:42-06:00 (Thursday)