Essential Programming: Sorting Algorithms

Sorting algorithms are fundamental to computer science. They turn disordered data into data ordered by some criteria, such as alphabetical, highest-to-lowest value or shortest to longest distance. The many applications of sorting algorithms include organizing items by price on a retail website and determining the order of sites on a search engine results page. In the following examples, we take one disordered list and sort it with 5 different algorithms: Selection Sort, Insertion Sort, Bubble Sort, Merge Sort and Quick Sort.