[Karl Buckland]

I've stumbled across a fairly cool website which features a collection of common sorting algorithms and has visual demos of how they sort. It also orders them from slower to faster methods. The site also includes code examples. These are written in Java, but obviously the algorithms could be programmed using any language you like.

http://www.cs.ubc.ca...rting-demo.html

It's very cool being able to see visually how these methods work. The Radix Sort Algorithm, which is clearly the fastest, is capable of doing two passes on the data and then sorting it in a single go. It appears to do this by generating a 'Radix' for each piece of data that needs to be sorted, which in this case represents the length of the information.

[benbacardi]

Yea we were shown that in Further Maths...

[EncoderDecoder]

thanks for the links.. this will really help me as I am now currently starting my thesis..