📄️ Bubble Sort
A sorting algorithm where by adjacent elements are repeatedly compared. They will be swapped if they happen to be in the wrong order.
📄️ Bubble Sort Optimised
An extention to the normal bubble sort. The function stops when there are no swaps made in 1 iteration
📄️ Insertion Sort
A sorting algorithm where elements are divided into a sorted and unsorted portion. Elements from the unsorted portion are picked sequentially and placed into the correct position.
📄️ Merge Sort
A recursive sorting algorithm where elements are divided into 2 halves. The function will call itself on both halves, followed by a merge function to merge the 2 sorted halves.
📄️ Quick Sort
A recursive sorting algorithm which makes use of Divide and Conquer. The function will call itself on both halves, followed by a merge function to merge the 2 sorted halves.
📄️ Selection Sort
A sorting algorithm whichrepeatedly finds the element of highest priority from the unsorted portion and placing it at the back of the sorted portion