mergesort.h File Reference

#include <algorithm>
#include <list>
#include <vector>

Include dependency graph for mergesort.h:

Namespaces
namespace	dsac
	Code from the zyBook "Data Structures and Algorithms in C++" by Goodrich/Tamassia/Mount/Goldwasser.
namespace	dsac::sorting
	Code from the chapter "Sorting and Selection".

Functions
template<typename T , typename Compare >
void	dsac::sorting::merge (const std::vector< T > &S1, const std::vector< T > &S2, std::vector< T > &S, Compare comp)
	Merges the contents of sorted vectors S1 and S2 into result S.
template<typename T , typename Compare >
void	dsac::sorting::merge_sort (std::vector< T > &S, Compare comp)
	Sorts the contents of vector S using the given comparator to define the element ordering.
template<typename T , typename Compare >
void	dsac::sorting::merge (const std::vector< T > &in, std::vector< T > &out, Compare comp, int start, int inc)
template<typename T , typename Compare >
void	dsac::sorting::merge_sort_bottom_up (std::vector< T > &S, Compare comp)
template<typename T , typename Compare >
void	dsac::sorting::merge (const std::list< T > &S1, const std::list< T > &S2, std::list< T > &S, Compare comp)
template<typename T , typename Compare >
void	dsac::sorting::merge_sort (std::list< T > &S, Compare comp)
template<typename T >
void	dsac::sorting::merge_sort (std::vector< T > &S)
template<typename T >
void	dsac::sorting::merge_sort (std::list< T > &S)
template<typename T >
void	dsac::sorting::merge_sort_bottom_up (std::vector< T > &S)