xachetbay

Insertion Sort

Nov 28th, 2019
225
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 0.62 KB | None | 0 0
  1. #include<iostream>
  2. using namespace std;
  3.  
  4. void sort(int a[], int length){
  5.     int i,j, key;
  6.     for(j = 1; j < length; j++){
  7.         key = a[j];
  8.         i = j - 1;
  9.        
  10.         while (i >= 0 && a[i] > key){
  11.             a[i+1] = a[i];         
  12.             i--;           
  13.         }
  14.         a[i+1] = key;
  15.     }  
  16. }
  17.  
  18. void input(int a[], int length){
  19.     for(int i = 0; i < length; i++){
  20.         cout<<"a["<<i<<"] = ";cin>>a[i];
  21.     }  
  22. }
  23. void print(int a[], int length){
  24.         cout<<"Mang da xap xep:"<<endl;
  25.         for(int i = 0; i < length; i++){
  26.         cout<<a[i]<<"\t";
  27.     }
  28. }
  29.  
  30. int main(){
  31.         cout<<"Nhap n: ";int n; cin>>n;
  32.         cout<<"Nhap mang:\n";
  33.         int a[n];
  34.         input(a, n);
  35.         sort(a, n);
  36.         print(a, n);
  37. }
Advertisement
Add Comment
Please, Sign In to add comment