Results 1 to 2 of 2

Thread: HashMap Speed

  1. Mar 31st, 2004, 03:29 AM #1
    slipper
    slipper is offline

    Thread Starter
    Member
    Join Date
    May 2002
    Location
    AUS
    Posts
    38

    HashMap Speed

    Does anyone know how fast the get(key) function is compared to a typical binary search.

    Would it be faster than a binary search on a sorted arrayList?

    ie how many accesses on average till it finds the required node/ value.
    Last edited by slipper; Mar 31st, 2004 at 03:35 AM.
    Reply With Quote Reply With Quote
  2. Apr 1st, 2004, 02:35 AM #2
    CornedBee
    CornedBee is offline
    Kitten CornedBee's Avatar
    Join Date
    Aug 2001
    Location
    In a microchip!
    Posts
    11,594
    If the HashMap is large enough and the hash function is good, it takes an average of a single access to find an element.
    All the buzzt
    CornedBee

    "Writing specifications is like writing a novel. Writing code is like writing poetry."
    - Anonymous, published by Raymond Chen

    Don't PM me with your problems, I scan most of the forums daily. If you do PM me, I will not answer your question.
    Reply With Quote Reply With Quote
« Previous Thread | Next Thread »

Posting Permissions

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

Forum Rules


Click Here to Expand Forum to Full Width