Hi, I want to implement an OPMPH function for the words in a dictionary in C++. How do I do it?
Thanks!
Hi, I want to implement an OPMPH function for the words in a dictionary in C++. How do I do it?
Thanks!
Have you looked at these papers?
Limit your word length to 6 letters or less and you might be able to make it work. Not very practical.
If you need alphabetical order use a Trie or a DAWG (like I recommended in your last question). For an order besides alphabetic I would use a binary tree (std::map in C++ is implemented with a red-black tree usually).
Implementing an order preserving hash container sounds like the mother of all early optimizations.