Published by Dimitris Kougioumtzis · Updated
Insert each value into an already sorted prefix.
Keep a sorted prefix and move the next value left until its position in that prefix is correct.
When to use Insertion sort
Small arrays and nearly sorted batches.
Choosing an alternative
Merge sort has a stronger bound for large inputs.
Worked example: input and state changes
Example input
38, 12, 65, 8, 43, 27, 91, 19
These checkpoints follow the actual example timeline. State details show the stored values and decisions; use the visualization to inspect every intervening step.
Step 0: Initial state.
State at this checkpoint
{ "values": [ 38, 12, 65, 8, 43, 27, 91, 19 ], "active": [] }Step 8: Compare with the sorted prefix.
State at this checkpoint
{ "values": [ 12, 8, 38, 65, 43, 27, 91, 19 ], "active": [ 0, 1 ] }Step 16: Move left.
State at this checkpoint
{ "values": [ 8, 12, 38, 27, 43, 65, 91, 19 ], "active": [ 3, 4 ] }Step 24: Move left.
State at this checkpoint
{ "values": [ 8, 12, 27, 38, 43, 19, 65, 91 ], "active": [ 5, 6 ] }Step 32: Complete: values are in ascending order.
State at this checkpoint
{ "values": [ 8, 12, 19, 27, 38, 43, 65, 91 ], "active": [] }
Expected final state
Complete: values are in ascending order.
Complexity and input bounds
Family: Sorting. Time complexity: O(n²).
Space complexity: O(1) auxiliary space.
Working-space bounds describe algorithm state and any explicitly noted output, excluding the visualization's saved timeline. Recording frames can use more memory than running the function alone. Here n is sequence length, V and E are vertex and edge counts, and other parameters refer to the named input dimensions.
2ā24 comma-separated integers between 0 and 99.
The playground validates these limits before starting. Downloaded functions are callable implementations, with parameter and output-buffer contracts in their comments; they do not all repeat the playground's input validation.
Common mistakes and limitations
Use strict comparisons when shifting to avoid needlessly reversing equal records.
Further reading
For background on algorithm analysis and the JavaScript function interface:
- MIT OpenCourseWare: algorithm design and analysis foundations
- MDN: JavaScript function parameters and return values
Editorial and testing approach · Browse all algorithm guides
Complete JavaScript implementation
1 2 3 4 5 6 7 8 9 10 | // Sorts a in place. n is the array length. Return value 0 indicates completion. Reference snippets assume validated playground inputs. Fixed scratch buffers have 256 slots. Sorting variants may use a different traversal strategy than the animation. function algorithm(a, n) { for (let i = 1; i < n; i++) { let j = i; while (j > 0 && a[j - 1] > a[j]) { let t = a[j]; a[j] = a[j - 1]; a[j - 1] = t; j--; } } return 0; } |
Source
No original paper has been verified for this entry. This source is a reference text or teaching reference, not an asserted original publication.
- The Art of Computer Programming, Volume 3: Sorting and Searching (2nd edition)
Donald E. Knuth (1998). Reference book.