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.
  1. Prepare
  2. Algorithms
  3. Sorting
  4. Insertion Sort - Part 1
  5. Discussions

Insertion Sort - Part 1

  • ihorfinance
     + 0 comments

    C++ (more at https://github.com/IhorVodko/Hackerrank_solutions/tree/master , feel free to give a star :) )

    void print(std::vector<int> const & _arr){
    using namespace std;
    for(auto & num : _arr){
        cout << num << " ";
    }
    cout << "\n";
}

void insertionSort1(
        int const & _num
    ,   std::vector<int> & _arr
){
    using namespace std;
    auto num = _arr.back();
    auto itLast = --rend(_arr);
    for(auto it = ++rbegin(_arr); it != rend(_arr); ++it){
        if(*it < num){
            *(it - 1) = num;
            ::print(_arr);
            return;  
        }
        *(it - 1) = *it;
        ::print(_arr);
        if(it == itLast){
            *it = num;
            ::print(_arr);
        }
    }
}