Skip to main content

Insertion Sort

Pass the array of numbers which needs to be sorted.


import { selectionSort } from 'athro';

const arr = [2, 6, 3, 8];

const result = insertionSort(arr)

Time Complexity

The time complexity of Insertion Sort is:

CaseTime ComplexityDescription
BestO(n)When the data is already sorted upto some extent
AverageO(n2)n comparisons for n items
WorstO(n2)n comparisons for n items