Insertion Sort

Pass the array of numbers which needs to be sorted.

Usage

src/sample/insertionsort.ts

import { selectionSort } from 'athro';

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

const result = insertionSort(arr)

Time Complexity

The time complexity of Insertion Sort is:

Case	Time Complexity	Description
Best	O(n)	When the data is already sorted upto some extent
Average	O(n2)	n comparisons for n items
Worst	O(n2)	n comparisons for n items