File:Insertion_sort.gif · Wikimedia Commons · See Wikimedia Commons
Insertion sort
Sign in to savesorting algorithm that, at each iteration, inserts the current input element into the suitable position between the already sorted elements
Key facts
- Class
- Sorting algorithm
- Data structure
- Array
- Worst case performance
- O ( n 2 ) {\displaystyle O(n^{2})} comparisons and swaps
- Best case performance
- O ( n ) {\displaystyle O(n)} comparisons, O ( 1 ) {\displaystyle O(1)} swaps
- Average performance
- O ( n 2 ) {\displaystyle O(n^{2})} comparisons and swaps
- Worst case space complexity
- O ( n ) {\displaystyle O(n)} total, O ( 1 ) {\displaystyle O(1)} auxiliary
- Optimal
- No
via Wikipedia infobox
Article · Nederlands
Insertion sort is een sorteeralgoritme.
Abstract from DBpedia / Wikipedia · CC BY-SA