Results 1 to 2 of 2

Thread: HashMap Speed

Threaded View

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