Insertion Sort Algorithm

[opengenus]

Insertion sort algorithm is an online stable in-place sorting algorithm that builds the final sorted list one item at a time. It works on the principle of moving an element to its correct position.

The average case time complexity is O(N^2) and the auxiliary space complexity is O(1).

Refer the article for more details and implementations.

Share your thoughts or ask any questions below.

---

This is a companion discussion topic for the original entry at http://iq.opengenus.org/insertion-sort/