A Voyage through Algorithms using Javascript - Insertion Sort

Insertion Sort is a simple sorting algorithm that builds the final sorted array one item at a time. It works by comparing each element with the sorted portion of the array and inserting it into the correct position. The algorithm has a time complexity of O(n^2) in average and worst cases, but performs well on small or nearly sorted datasets. Insertion Sort is stable, in-place, and adaptive, making it useful for certain scenarios like sorting small arrays or as part of hybrid sorting algorithms.