INSERTION SORT

 avatar
user_6075971
plain_text
2 years ago
656 B
0
Indexable
Never
#include<iostream>
using namespace std;
int main()
{
    //****INSERTION SORT*****
    
    int arr[100];
    int n;
    cout << "ENTER THE ARRAY SIZE--->";
    cin >> n;
    for (int i = 0; i < n; i++)
    {
        cin >> arr[i];
    }
    for (int i = 0; i < n; i++)
    {
        cout << arr[i] << "  ";
    }
    cout<<endl;
    
    for(int i=1;i<n;i++)
    {
        int current =arr[i];
        int j=i-1;
        while(arr[j]>current&&j>=0)
        {
            arr[j+1]=arr[j];
            j--;
        }
        arr[j+1]=current;
    }
     for (int i = 0; i < n; i++)
    {
        cout << arr[i] << "  ";
    }
    cout<<endl;
    return 0;
}