Question

(15 points) Implement the insertion sort algorithm using C++. Assume data is stored in arr), and the size of the array is n. void insertion Sortint arri], int n)

Answer 1

1.CODE->

#include <iostream>
using namespace std;
void insertionSort(int arr[],int n)
{
int i,key,j;
for(i=1;i<n;i++)
{
key=arr[i]; //key is the number which we want to put at right place
  
j=i-1;
while (j>=0 && arr[j]>key) //this loop is to shift elements greater than key to 1 position right
{
arr[j+1]=arr[j];
j--;
}
arr[j+1]=key; //placing the key at its correct position
}
}

int main() //main function to test our insertion sort function
{
int array[]={20,17,15,9,7,3};
int n=sizeof(array)/sizeof(array[0]);
insertionSort(array,n);
  
  
for (int i=0;i<n;i++) // array after sorting
cout<<array[i]<<" ";
cout << endl;
  
return 0;
}

2.OUTPUT->

input 3 7 9 15 17 20 - - Program finished with exit code o Press ENTER to exit console.

   I HOPE YOU WILL GET IT...........YOUR RESPONSE WILL BE HIGHLY APPRECIATED