In this post, we will write a C++ program to sort the numbers by using insertion sort. the program will print the list before the sorting of the list and then also print after sorting the list.
C++ program to sort the numbers by using insertion sort.
#include<iostream>
#include<conio.h>
#include<stdlib.h>
int main()
{
system("cls");
int a[10];
int i,min,temp,ptr;
a[0] = -32678;
for(i=1;i<=9;i++)
a[i] = rand()%100;
for(i=1;i<=9;i++)
std::cout<<a[i]<<"\t";
std::cout<<std::endl<<"The list after sorting"<<std::endl;
for(i=1;i<=9;i++)
{
temp = a[i];
ptr = i-1;
while(temp < a[ptr])
{
a[ptr+1] = a[ptr];
ptr = ptr-1;
}
a[ptr+1] = temp;
}
for(i=1;i<=9;i++)
std::cout<<a[i]<<"\t";
getch();
return 0;
}
Output
46 30 82 90 56 17 95 15 48 The list after sorting 15 17 30 46 48 56 82 90 95
0 Comments