Implementation of insertion sort as an exercise.

insertion_sort.hpp

#pragma once

#include <algorithm>
    
template <typename IT>
void insertion_sort(IT begin, IT end) {
    for (IT i = begin; i != end; ++i) {
        for (IT j = i; j != begin; --j) {
            if (*(j-1) > *j) std::iter_swap(j-1, j);
            else break;
        }
    }
}