75 lines
2.4 KiB
C++
75 lines
2.4 KiB
C++
#pragma once
|
|
|
|
#include <vector>
|
|
#include <algorithm>
|
|
|
|
namespace algo {
|
|
|
|
template<typename Iterator, typename Comparator>
|
|
void merge(Iterator start, Iterator middle, Iterator end, Comparator cmp, Iterator output_start) {
|
|
Iterator start_m = start;
|
|
Iterator begin = output_start;
|
|
Iterator start2 = middle + 1;
|
|
|
|
//merge from input until one half completes
|
|
while (start <= middle && start2 <= end) {
|
|
if (cmp(*start, *start2)) {
|
|
*output_start = *start;
|
|
start++;
|
|
} else {
|
|
*output_start = *start2;
|
|
start2++;
|
|
}
|
|
output_start++;
|
|
}
|
|
|
|
//try to finish first half
|
|
while (start <= middle) {
|
|
*output_start = *start;
|
|
start++;
|
|
output_start++;
|
|
}
|
|
|
|
while (start2 <= end) {
|
|
*output_start = *start2;
|
|
start2++;
|
|
output_start++;
|
|
}
|
|
|
|
const auto size = std::distance(start_m, end);
|
|
for (auto i = 0; i <= size; i++, start_m++, begin++) {
|
|
*start_m = *begin;
|
|
}
|
|
|
|
}
|
|
|
|
template<typename Container, typename Iterator, typename Comparator>
|
|
void ms_split(Container &output_vec, Iterator start, Iterator end, Comparator cmp, Iterator output_start) {
|
|
Iterator mid = start;
|
|
Iterator begin = output_start;
|
|
|
|
if (std::distance(start, end) < 1) {
|
|
return;
|
|
} else {
|
|
//move mid iterator litterally to the mid
|
|
std::advance(mid, std::distance(start, end) / 2);
|
|
//sort the first half within an recursion
|
|
ms_split(output_vec, start, mid, cmp, output_start);
|
|
|
|
//move output iterator
|
|
std::advance(output_start, std::distance(start, mid + 1));
|
|
//sort the second half within a recursion
|
|
ms_split(output_vec, mid + 1, end, cmp, output_start);
|
|
|
|
//merge everything together starting from the complete beginning
|
|
merge(start, mid, end, cmp, begin);
|
|
}
|
|
}
|
|
|
|
template<typename Iterator, typename Comparator>
|
|
void mergesort(Iterator start, Iterator end, Comparator cmp) {
|
|
using valtype = typename std::iterator_traits<Iterator>::value_type;
|
|
std::vector<valtype> temporary_dataset(std::distance(start, end));
|
|
ms_split(temporary_dataset, start, end - 1, cmp, temporary_dataset.begin());
|
|
}
|
|
} |