CodeGuru Home VC++ / MFC / C++ .NET / C# Visual Basic VB Forums Developer.com
Results 1 to 4 of 4

Thread: Finger search

  1. #1
    Join Date
    May 2008
    Posts
    2

    Finger search

    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...

  2. #2
    Join Date
    Mar 2002
    Location
    St. Petersburg, Florida, USA
    Posts
    12,125

    Re: Finger search

    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.....
    TheCPUWizard is a registered trademark, all rights reserved. (If this post was helpful, please RATE it!)
    2008, 2009,2010
    In theory, there is no difference between theory and practice; in practice there is.

    * Join the fight, refuse to respond to posts that contain code outside of [code] ... [/code] tags. See here for instructions
    * How NOT to post a question here
    * Of course you read this carefully before you posted
    * Need homework help? Read this first

  3. #3
    Join Date
    Apr 2007
    Location
    Mars NASA Station
    Posts
    1,436

    Re: Finger search

    First of all, What is finger tree ? i really never heard before.

  4. #4
    Join Date
    May 2008
    Posts
    2

    Re: Finger search

    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.

Posting Permissions

  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts
  •  





Click Here to Expand Forum to Full Width

Featured