Algorithms 101: JavaScript Insertion Sort and It’s Big O Notation

Considered a simple sorting algorithm, insertion sort is not without its merits. While not as efficient as more advanced algorithms when scaled, it is a stable algorithm in that it does not change the relative order of elements with equal values. It is also an excellent choice when you have to continually add new data as it is received. This is because it only needs to do one…