1. Coreman, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms, 3rd edn. MIT Press (2009)
2. Traditional insertion algorithm–\en.wikipedia/wiki/Insertion_sort. Three lines implementation and five-lines optimized version by Bentley, J.: Programming Pearls. Addison-Wesley Professional (1999)
3. Bender, M.A.. Farach-Colton, M., Mosteiro, M.: Insertion sort is O(n log n). SUNYSB (2006).
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.60.3758
4. Garg, A., Goswami, S., Garg, V.: CutShort: a hybrid sorting technique. In: 2016 International Conference on Computing, Communication and Automation (ICCCA) (2016). Available
https://doi.org/10.1109/ccaa.2016.7813705
5. Sorting Algorithm. En.wikipedia.org (2020). [Online]. Available
https://en.wikipedia.org/wiki/Sorting_algorithm
. Accessed 19 Jan 2020