Sorting and Efficency

Sorting and the algorithms/ techniques that have been developed to sort, are useful in computer science. Essentially sorting, as the name suggests, is sorting elements of a collection in a certain way. These ways vary, and can be sorted alphabetically, by length ect. The algorithms used for these different collections of elements are chosen to sort a specific collection either because they are the most efficient(relative to the number of elements being processed)/quickest run time, or are appropriate for the collection. To choose the most efficient algorithm, we compare them all to see which one took the least amount of steps/ switches. The algorithms are; bubble sort, selection sort, insertion sort, shell sort, merge sort, tim sort, and quick sort.