Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- void insertionSort(int a[], int n)
- {
- int j;
- for(int i=1;i<n;i++){
- int temp=a[i];
- for(j=i-1;j>=0 && temp<a[j];j--){
- a[j+1]=a[j];
- }
- a[j+1]=temp;
- }
- }
- int main()
- {
- int n;
- scanf("%d", &n);
- int a[n+3];
- for(int i=0;i<n;i++) scanf("%d", &a[i]);
- insertionSort(a,n);
- for(int i=0;i<n;i++) printf("%d ", &a[i]);
- printf("\n");
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement