heapsort.hxx File Reference

Header declaring template functions for sorting an array of index-objects indexing an array of value-objects comparable by "<". More...

#include "mymath.hxx"

Go to the source code of this file.

Namespaces
	CH_Tools
	Some convenient inline tools like a clock for timing, a random number generator, a heapsort template sorting indices.

Functions
template<class I , class V >
void	CH_Tools::heapify (int i, int n, I &ind, const V &val, bool non_decreasing=true)
	Heapify element i (in 0,...,n-1) in ind, so that afterwards val[ind[j]]>=max(val[ind[2*j+1]],val[ind[2*j+2]] for the subtree with root i. More...
template<class I , class V >
void	CH_Tools::build_heap (int n, I &ind, const V &val, bool non_decreasing=true)
	Build a heap out of ind[0] to ind[n-1], so that val[ind[j]]>=max(val[ind[2*j+1]],val[ind[2*j+2]] for all j. More...
template<class I , class V >
void	CH_Tools::heapsort (int n, I &ind, const V &val, bool non_decreasing=true)
	Sort ind[0]...ind[n-1] so that val[ind[i]]<=val[ind[j]] for 0<=i<j<n. More...
template<class I , class V >
void	CH_Tools::heapify (int i, int n, I *ind, const V *val, bool non_decreasing=true)
	More efficient variant for pointers to indices and values: Heapify element i (in 0,...,n-1) in ind, so that afterwards val[ind[j]]>=max(val[ind[2*j+1]],val[ind[2*j+2]] for the subtree with root i. More...
template<class I , class V >
void	CH_Tools::build_heap (int n, I *ind, const V *val, bool non_decreasing=true)
	More efficient variant for pointers to indices and values: Build a heap out of ind[0] to ind[n-1], so that val[ind[j]]>=max(val[ind[2*j+1]],val[ind[2*j+2]] for all j. More...
template<class I , class V >
void	CH_Tools::heapsort (int n, I *ind, const V *val, bool non_decreasing=true)
	More efficient variant for pointers to indices and values: Sort ind[0]...ind[n-1] so that val[ind[i]]<=val[ind[j]] for 0<=i<j<n. More...

Detailed Description

Header declaring template functions for sorting an array of index-objects indexing an array of value-objects comparable by "<".

Version

1.0

Date

2005-03-01

Author

Christoph Helmberg