#geeks_quiz_datastructure

Question

Consider the following list of the integer:

19, 23, 40, 32, 91, 25, 100, 36 

Sort this list in increasing order using insertion sort and determine the number of passes, comparisons, and swaps ?

A	7, 14, 8 respectively.
B	7, 7, 14 respectively.
C	8, 7, 12 respectively.
D	8, 14, 7 respectively.

Comments

@anjali007

For Comparison This is the formula

Minimum number of insertion sort comparisons  =  N - 1

Maximum number of insertion sort comparisons  =  1/2(N² - N)

Average number of insertion sort comparisons  =  1/4(N² - N)

For Swaps this code may help.

#include <stdio.h>
int main() {
   int N, swaps, temp[100], i, j;
   scanf("%d", & N);
   int arr[N];
   swaps = 0;
   for (i = 0; i < N; i++) {
       scanf("%d", & temp[i]);
       j = i;
       while (j > 0 && arr[j - 1] > temp[i]) {
           arr[j] = arr[j - 1];
           ++swaps;
           --j;
       }
       arr[j] = temp[i];
   }
   printf("%d", swaps);
   return 0;
}

 

---

@kumar.dilip Thanks...

---

 kumar.dilip you cannot get the exact value by the formula right if they give element you need to do manual approach i guess?