We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
Loading...
  1. Practice
  2. Algorithms
  3. Sorting
  4. Insertion Sort - Part 2
  5. Discussions

Insertion Sort - Part 2

  • gursimran16 + 1 comment
    #include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;


int main() {
        int n, x;
        cin >> n;
        vector <int> a;
        for(int i = 0; i < n; i++){
                cin >> x;
                a.push_back(x);
        }
        for(int i = 1; i < n; i++){
              int j = i - 1;
                while(a[j] > a[j+1]){
                        int temp = a[j+1];
                        a[j+1] = a[j];
                        a[j] = temp;
                        j--;
                }
                for(int i = 0; i < n; i++){
                        cout << a[i] << " ";
                }
                cout << endl;
        }
    return 0;
}
    • b0kater + 0 comments

      No, you are not supposed to put the element into the sorted array until you find its final position.

      Originally linked by someone else: https://upload.wikimedia.org/wikipedia/commons/0/0f/Insertion-sort-example-300px.gif