Comparing AVL Trees in C++ and Haskell

This post compares the runtimes of AVL tree operations in C++ vs Haskell. In particular, we insert 713,000 strings from a file into an AVL Tree. This is a \(O(n \log n)\) operation. But we want to investigate what the constant factor looks like in different situations. Experimental setup: All the code for these tests is available in the github repository. The C++ AVL tree was created in a data str

[VoQn]

AVL木の実装でCPU1コアだと負けたけどParallel使って4コア並列化させたらC++の実装よりもハイパフォーマンスにできたぜ的な話

[yohshiy]

AVL 木での C++ と Haskell の比較。