Analysis of Sorting Algorithms

The end of the semester is nearing, and one of the final homework assignments for my Data Structures class is to implement a few different sorting algorithms.

The class started at the beginning of the semester by implementing the terrible Bubble Sort algorithm (the utility of which I’m still trying to find). Its only fitting the class would end by implementing the Selection Sort, Insertion Sort and Quick Sort algorithms.

Through researching different techniques of implementing these algorithms, I ran across a very neat website labeled Sorting Algorithms Demo. The website is chock full of little java applets that show you just how fast some of these sorting algorithms are compared with each other.

If this sort of thing interests you at all, I highly suggest you check it out: http://www.cs.ubc.ca/~harrison/Java/sorting-demo.html.

UPDATE: Just discovered this even cooler website: http://www.sorting-algorithms.com/

Click to share: Share on FacebookShare on Google+Share on RedditTweet about this on TwitterPin on Pinterest

Leave a Reply

Your email address will not be published. Required fields are marked *

You may use these HTML tags and attributes: <a href="" title=""> <abbr title=""> <acronym title=""> <b> <blockquote cite=""> <cite> <code class="" title="" data-url=""> <del datetime=""> <em> <i> <q cite=""> <strike> <strong> <pre class="" title="" data-url=""> <span class="" title="" data-url="">