Design
heapltd.txt
Associated article: Heap Ltd.
Tags: Design
Published source code accompanying the article by Evgeniy Gabrilovich and Alex Gontmakher in which they examine various existing sorting and seraching algorithms, then present their "limited heap" which arguably provides the best tradeoff between speed and memory utilization. Also see HEAPLTD.ZIP.
Heap Ltd.
by Evgeniy Gabrilovich and Alex Gontmakher
Listing One
using namespace std;
template<class _Key,class _T> class KMaxValues:public vector<pair<_Key,_T> > {
typedef vector<pair<_Key, _T> > ...


