greatsplife

Insertion Sort Algorithm Insertion sort is   a sorting algorithm  that places an unsorted element at its suitable place in each iteration. Insertion sort works similarly as we sort cards in our hand in a card game. We assume that the first card is already sorted then, we select an unsorted card. If the unsorted card is greater than the card in hand, it is placed on the right otherwise, to the left. In the same way, other unsorted cards are taken and put in their right place. The first element in the array is assumed to be sorted. Take the second element and store it separately in temp Compare  temp  with the first element. If the first element is greater than temp , then  temp  is placed in front of the first element. Insertion Sort Complexity Time Complexity   Best O(n) Worst O(n 2 ) Average O(n 2 ) Space Complexity O(1) Stability Yes Time Complexities Worst Case Complexity:   O(n 2 ) Suppose, an array is in ascending order, and you want to sort it in descending order. In this case, w