On Mon, 7 Feb 2005 00:30:12 +0200
Radu Grigore <radugrigore@gmail.com> wrote:

> On Sun, 06 Feb 2005 06:59:52 -0800 (PST), skaller
> <skaller@users.sourceforge.net> wrote:
> > If you know something of the distribution of your keys,
> > which are strings, you can also make this much faster
> > by indexing using some suitable monotonic function
> > on the string prefix, and only sorting equivalent
> > strings.
> 
> This is a nice idea that crossed my mind. If a simpler (to code)
> solution won't work I'll definitely try it.

Sounds a little like a simplified version of a TRIE:

    http://www.csse.monash.edu.au/~lloyd/tildeAlgDS/Tree/Trie/

Erik
-- 
+-----------------------------------------------------------+
  Erik de Castro Lopo  nospam@mega-nerd.com (Yes it's valid)
+-----------------------------------------------------------+
"The one thing that reading these five books has hammered home is how
much C++ has turned into 3 languages stuck in a bag fighting to get
out. Low C++, High C++, and Generic C++."