Printable View
Hello everyone...
Can anyone point me to a sample implementation of the finger search algorithm (preferably OO C++/Java)?
I have a 2-3-4 tree and i need to expand it to a finger tree for a college project. The only example i've found on the web is in Haskell and it seems very strange to me.
Thanks in advance...
Here is one in Scala... http://scala.sygneca.com/code/finger-trees
Seriously, you are most likely to continue finding implementations in the so called "functional" languages than you are in a class OO language.
The structure and methodology of FingerTrees make them great for that type of environment, but there are other algorithyms which are just simplier (and give equal or better performance).
Curious as to what course you are taking that a professor would give this as an assignment.....
First of all, What is finger tree ? i really never heard before.
Well... Thanks but in the same time that it'll take me to analyze this code i will have coded it myself from scratch. I just wanted to save a few hours but never mind.
Btw, the course is Advanced Data Structures and the assignment is about performance testing between B-trees and AVLs with various searching algorithms.