Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<iostream>
- using namespace std;
- void insertionsort(int a[], int N)
- {
- for(int i=0;i<N;i++)
- {
- int j=i-1;int key=a[i];
- while(j>=0 && a[j]>key)
- {
- a[j+1]=a[j];
- j--;
- }
- j++;
- a[j]=key;
- }
- }
- int main()
- {
- int arr[]={5,2,1,4};
- int N=sizeof(arr)/sizeof(int);
- insertionsort(arr,N);
- for(int i=0; i<N; i++)
- {
- cout<<arr[i]<<endl;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement