Question

1. [C++ language] Write down the steps how insertion sort for sorting the following elements in an array:

22, 1, 7, -9, 121, 75, 89, 29, 500, 43

I need Steps plus the code.

Answer 1

Steps :

1. 22 1 7 -9 121 75 89 29 500 43

2. 22 1 7 -9 121 75 89 29 500 43 //compare first and second elements

3. 1 22 7 -9 121 75 89 29 500 43 //swapping first and second elements

4. 1 22 7 -9 121 75 89 29 500 43 //compare third and previous elements

5. 1 7 22 -9 121 75 89 29 500 43 //swapping second and third elements

6. 1 7 22 -9 121 75 89 29 500 43 //compare fourth and previous elements

7. -9 1 7 22 121 75 89 29 500 43 //swapping elements first and fourth

8. -9 1 7 22 121 75 89 29 500 43 //compare fifth and previous elements

9. -9 1 7 22 121 75 89 29 500 43 // No swapping

10. -9 1 7 22 121 75 89 29 500 43   //compare sixth and previous elements

11. -9 1 7 22 75 121 89 29 500 43 //swapping elements sixth and fifth elements

12. -9 1 7 22 75 121 89 29 500 43 //compare seventh and previous elements

13. -9 1 7 22 75 89 121 29 500 43 //swapping sixth and seventh elements

14. -9 1 7 22 75 89 121 29 500 43 //compare seventh and previous elements

15. -9 1 7 22 75 89 121 29 500 43   // No swapping

16. -9 1 7 22 75 89 121 29 500 43   //compare eigth and previous elements

17. -9 1 7 22 29  75 89 121 500 43 //swapping fifth and eighth elements

18.   -9 1 7 22 29  75 89 121 500 43 //compare eigth and previous elements

19. -9 1 7 22 29  75 89 121 500 43 // No swapping

20. -9 1 7 22 29  75 89 121 500 43 // compare nineth and previous elements

21. -9 1 7 22 29  75 89 121 500 43 // No swapping

22. -9 1 7 22 29  75 89 121 500 43 // compare tenth and previous elements

23. -9 1 7 22 29 43 75 89 121 500 // swapping tenth and sixth elements

Code:

#include <iostream>
using namespace std;

void insort(int ar[],int n){
   int i,k,j;
   for(i=1;i<n;i++){
       k=ar[i];
       j=i-1;
       while(j>=0 && k<ar[j]){
           ar[j+1]=ar[j];
           j=j-1;
       }
       ar[j+1]=k;
   }
   for(i=1;i<n;i++){
       cout<<ar[i]<<" ";
   }
   cout<<endl;
}
int main()
{
   int ar[]={22,1,7,-9,121,75,89,29,500,43};
   int n=sizeof(ar)/sizeof(ar[0]);
   insort(ar,n);
   return 0;
}