Computer Science 200 – TME/Unit 2 - Chapter 8: Data Structures – Internet Research #2
Find a Web site that demonstrates different sorting algorithms, and share it with the class.
Sorting algorithms vary greatly in speed of execution due to their strategy used for comparing items in a list. The Bubble Sort, according to Anderson et al. (2011), “is an older and slower sort method” which begs the question of whether it has any real world applications. Surely everyone would rather use the Quicksort method.
From a programmer’s perspective, one could resolve to use the Bubble Sort since it is the simplest algorithm to implement and therefore support. Furthermore, with small data sets speed is typically irrelevant. For fun, you can take a look at the following YouTube video demonstrating a comparison of the Bubble Sort and Quicksort algorithms.
In addition, several other sorting algorithms can be compared by visiting the Carleton University’s Computational Geometry Lab website
___________________________________________________
References:
- Anderson, G., Ferro, D., & Hilton, R. (2011). Connecting with Computer Science (2nd ed.). Boston, MA: Course Technology, Cengage Learning.
- http://www.youtube.com/watch?v=F-7kk4lY_mQ
- http://cg.scs.carleton.ca/~morin/misc/sortalg/
Image may be NSFW.
Clik here to view.
Image may be NSFW.Clik here to view.
