**Question : **How much time Insertion sort takes to sort an array of size n in below form?

arr[] = 2, 1, 4, 3, 6, 5,….i, i-1, …..n, n-1

**Answer : ** At first look, it seems like Insertion Sort would take O(n^{2}) time, but it actually takes O(n) time

How? Let us take a closer look at below code.

/* Function to sort an array using insertion sort*/ void insertionSort(int arr[], int n) { for (int i = 1; i = 0 && arr[j] > key) { arr[j+1] = arr[j]; j = j-1; } arr[j+1] = key; } }

If we analyze the input carefully we see that every element is only one position away from its position in sorted array. The outer for loop will run till ‘n’ and the inner while loop would take “constant” steps of 1 swap and 2 comparisons. Since, while loop takes constant time and for loop runs for ‘n’ element, so overall complexity is O(n)

**Alternate Answer : **Another way to look at this is, time taken by Insertion Sort is proportional to number of inversions in an array. In above example type, number of inversions is n/2, so overall time complexity is O(n)

This article is contributed by **Uddalak Bhaduri**. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the **DSA Self Paced Course** at a student-friendly price and become industry ready.

## Recommended Posts:

- Time complexity of insertion sort when there are O(n) inversions?
- C program for Time Complexity plot of Bubble, Insertion and Selection Sort using Gnuplot
- Comparison among Bubble Sort, Selection Sort and Insertion Sort
- Python Code for time Complexity plot of Heap Sort
- Insertion sort to sort even and odd positioned elements in different orders
- Merge Sort vs. Insertion Sort
- Can QuickSort be implemented in O(nLogn) worst case time complexity?
- Recursive Insertion Sort
- Insertion Sort
- Insertion Sort for Doubly Linked List
- C Program for Insertion Sort
- Insertion sort using C++ STL
- C Program for Binary Insertion Sort
- Java Program for Binary Insertion Sort
- Python Program for Binary Insertion Sort
- C Program for Recursive Insertion Sort
- Java Program for Recursive Insertion Sort
- Python Program for Recursive Insertion Sort
- Insertion Sort by Swapping Elements
- Sorting algorithm visualization : Insertion Sort