Skip to content
← Back to Community
Insertion sort
Profile icon
sandeepnyoupane

It is a sorting technique where the sorted array is built by taking one item at a time. The array element are compared with each other sequentially and then arranged simultaneously some particular order.

Worst Case Time Complexity[Big-0]: O(n^2)
Best Case Time Complexity[Big -omega]:O(n)
Average Time Complexity [Big-theta] :O(n^2)

Voters
Profile icon
AidenDowns
Profile icon
sandeepnyoupane