Question

What is the time complaxity of insertion sort in worst, best and average case?

Answer 1

Explanation:

Complexity of Insertion Sort. Insertion sort runs in O ( n ) O(n) O(n) time in its best case and runs in O ( n 2 ) O(n^2) O(n2) in its worst and average cases.

Answer 2

Answer:

Insertion sort is a sorting algorithm that builds a final sorted array (sometimes called a list) one element at a time. While sorting is a simple concept, it is a basic principle used in complex computer programs such as file search, data compression, and path finding. Running time is an important thing to consider when selecting a sorting algorithm since efficiency is often thought of in terms of speed. Insertion sort has an average and worst-case running time of O(n^2)O