forked from 07sagar/data-structure
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path8.cpp
More file actions
55 lines (46 loc) · 655 Bytes
/
8.cpp
File metadata and controls
55 lines (46 loc) · 655 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
#include<iostream>
using namespace std;
void insertion_sort(int a[], int n)
{
for(int i=1;i<n;i++)
{
int key=a[i];
for(int j=i-1;j>=0;j--)
{
if(a[j]>key)
{
a[j+1]=a[j];
a[j]=key;
}
else
break;
}
}
}
void display(int a[], int n)
{
for(int i=0;i<n;i++)
cout<<a[i]<<" ";
cout<<endl;
}
int main()
{
cout<<"Enter the size of array"<<endl;
int n;
cin>>n;
int a[n+1];
cout<<"Enter the elements"<<endl;
for(int i=0;i<n;i++)
cin>>a[i];
insertion_sort(a,n);
cout<<"Sorted array is"<<endl;
display(a,n);
cout<<"Enter the element to be inserted"<<endl;
int e;
cin>>e;
a[n]=e;
insertion_sort(a,n+1);
cout<<"After insertion"<<endl;
display(a,n+1);
return 0;
}