Sorting

• Bubble Sort - Worst sorting algorithm and it is highly inefficient. Goes from left to right and if the number on the left is greater then they switch places.
• Insertion Sort - Removes one element from the input data and finds the location it belongs to within the sorted list, and inserts it there
• Selection Sort - Takes the smallest element in an unsorted array and brings it to the front
• Quick Sort - Breaking an array (Partition) into smaller ones and swapping (exchanging) the smaller ones, depending on a comparison with the ‘pivot’ element.
• Quick Sort efficiency - O(n log n)
• Selection Sort efficiency - O(n^2)
• Insertion Sort efficiency - O(n)
• Quick Sort efficiency - O(n^2)