contains/
containsKey
getset/
put
addremove
size
iteration
ConcurrentSkipListMap
log(n)log(n)log(n) log(n)nn
HashMap
ConcurrentHashMap
Hashtable
1 1 1 11n (of capacity, not size)
LinkedHashMap
1 1 1 11n (of size, not capacity)
TreeMap
log(n)log(n)log(n) log(n)1n
ArrayList
n
111 (amortized
constant time)?
n1n
LinkedListn
nn
1n (removal is
1 at either
end of the list)
 1n
 
       
        
        
Version 1.1 last modified by Geoff Fortytwo on 14/11/2008 at 20:22

Attachments 0

No attachments for this document
Website Top
Send Me Mail!:
   g42website4 AT g42.org
My Encyclopaedia Blog

Creator: Geoff Fortytwo on 2008/11/14 20:22
Copyright 2004-2007 (c) XPertNet and Contributing Authors
1.3.2.9174