Algorithms_in_C++ 1.0.0
Set of algorithms implemented in C++.
|
#include <cstddef>
#include <iostream>
#include <utility>
Namespaces | |
namespace | sorting |
for working with vectors | |
Functions | |
template<class Iterator > | |
void | sorting::merge (Iterator l, Iterator r, const Iterator e, char b[]) |
merges 2 sorted adjacent segments into a larger sorted segment | |
template<class Iterator > | |
void | sorting::non_recursive_merge_sort (const Iterator first, const Iterator last, const size_t n) |
bottom-up merge sort which sorts elements in a non-decreasing order | |
template<class Iterator > | |
void | sorting::non_recursive_merge_sort (const Iterator first, const size_t n) |
bottom-up merge sort which sorts elements in a non-decreasing order | |
template<class Iterator > | |
void | sorting::non_recursive_merge_sort (const Iterator first, const Iterator last) |
bottom-up merge sort which sorts elements in a non-decreasing order | |
int | main (int argc, char **argv) |
Copyright 2020
A generic implementation of non-recursive merge sort.