Quick explanation of insertion sort and how it works.
Insertion sort has an average time complexity of O(n^2), a worst case time complexity of O(n^2), and a best case time complexity of O(n).
Implementations of insertion sort can be found here: https://www.geeksforgeeks.org/insertion-sort/
Good resource explaining insertion sort (with diagrams): https://www.happycoders.eu/algorithms/insertion-sort/#:~:text=Insertion%20Sort%20is%20an%20easy,as%20Quicksort%20or%20Merge%20Sort.
