Stable Merge Sort using C++14

merge_sort.cpp

#include <algorithm>
#include <iterator>
#include <functional>

template<typename BiDirIt, typename Compare = std::less<> >
void Merge_Sort(BiDirIt first, BiDirIt last, Compare comp = Compare {}) {
		
	const auto n = std::distance(first, last);
		
	if (n > 1) {
		const auto middle = std::next(first, n / 2);
        
       	Merge_Sort(first, middle, cmp);
       	Merge_Sort(middle, last, cmp);
        
       	std::inplace_merge(first, middle, last, cmp);
	}
}