Insertion sort is an algorithm that sorts an array of numbers by dividing it into sorted and unsorted portions. It inserts unsorted values into their correct positions in the sorted subarray one by one. The code sample demonstrates insertion sort by taking in 10 user-inputted numbers, sorting them in place using insertion sort logic, and outputting the sorted array.

1. BY- KOMAL KHETLANI

2. It is one way to sort an array of
numbers. Data is divided into sorted
and unsorted portions. One by one
,the unsorted values are inserted into
their appropriate positions in the
sorted subarray.

3. #include<iostream>
using namespace std;
main()
{
int a[10],i,j,element;
cout<<"Enter 10 numbers"<<endl;
for(i=0;i<10;i++)
{
cin>>a[i];
}

4. for(i=1;i<9;i++)
{
j=i;
element=a[i];
while(j>0 && element<a[j-1])
{
a[j]=a[j-1];
j=j-1;
a[j]=element;
}

5. }
cout<<"Sorted numbers are"<<endl;
for(i=0;i<9;i++)
{
cout<<a[i]<<endl;
}
}