JavaScript Algorithms and Data Structures: Sorting - Insertion Sort
Insertion sort is a sorting algorithm that works by repeatedly inserting an element into its correct position in a sorted array. Learn how to implement insertion sort in JavaScript.
Insertion sort is a simple sorting algorithm that builds the final sorted array (or list) one item at a time. It is much less efficient on large lists than more advanced algorithms such as quicksort, heapsort, or merge sort.
Complexity
| Name | Best | Average | Worst | Memory | Stable | Comments |
|---|---|---|---|---|---|---|
| Insertion sort | n | n2 | n2 | 1 | Yes |
References
The Original Article can be found on https://github.com
#javascript #algorithms #datastructures #sorting
2.70 GEEK