> I want to add that the most efficient thing for modern processors isn't > necessarily the most efficient theoretical algorithm. Years ago for > instance hash tables were "more efficient" than they are today, but now > perhaps B-Tree's win for similar purposes because they are designed to > be cache friendly. In theory hash tables are as fast as you can > get.
Hi Don, Do you have an article or paper you can point me to on that subject? In an article on optimization I wrote, about a real-world (but focussed) application, the speed up in moving from C++'s std::map to std::tr1::unordered_map was from 28s to 19.8s. Perhaps the difference was even bigger on older CPUs, but in this case we certainly want to stick with hashing. Darren -- Darren Cook, Software Researcher/Developer http://dcook.org/mlsn/ (English-Japanese-German-Chinese-Arabic open source dictionary/semantic network) http://dcook.org/work/ (About me and my work) http://dcook.org/blogs.html (My blogs and articles) _______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
