Insertion sort algorithm

Insertion sort is a simple sorting algorithm: a comparison sort in which the sorted array/list is built one entry at a time. It is much less efficient on large lists than more advanced algorithms such as quicksort, heapsort or merge sort. Created for educational purpose , please check this video that explains the entire algorithm:


Leave a Reply

Your email address will not be published. Required fields are marked *

This site uses Akismet to reduce spam. Learn how your comment data is processed.