Tyler Earman wrote: > Hmm these seem like good options. I was hoping to have a more portable > algorithm (language-wise), but its not necessary really. As long as the > runtime performance is around O(n*logn) or better. I'm not quite sure what you mean by more portable; I can't think of any more portable structure than a hash table. Andrew..
