Insertion Sort

This is the continuation of the last article on selection sort. Please check it if you didn’t read it yet. The last of the slow algorithms we will talk about is insertion sort. This is the best performing algorithm for small arrays. The idea is also very simple and like selection sort the array is… Continue reading Insertion Sort