ch
Sent: Wednesday, October 21, 2009 11:46 AM
To: flexcoders@yahoogroups.com
Subject: [flexcoders] Re: Performance of associative array or dictionary lookup
What's the big O of a lookup in the hash table? If I were to use an array and
just iterate sequentially through the array looking f
What's the big O of a lookup in the hash table? If I were to use an array and
just iterate sequentially through the array looking for an item it would be
O(n) in the worst case scenario (if what I'm looking for happens to be in the
last position in the array). What's the worst case scenario for
2 matches
Mail list logo
