Next post will be about Montreal, I promise
Oz: oh man
Oz: I'm looking for info on sounds like searches
Oz: I was muddling through some wikipedia link on search algorithms and found this:
Oz: Hash tables are also used for list search, requiring only constant time for search in the average case, but more space overhead and terrible O(n) worst-case search time. Another search based on specialized data structures uses self-balancing binary search trees and requires O(log n) time to search; these can be seen as extending the main ideas of binary search to allow fast insertion and removal. See associative array for more discussion of list search data structures.
Oz: I nearly hit the floor shivering in horror from big o flashbacks
Uncle Pauly: That's what she said
Oz: I'm looking for info on sounds like searches
Oz: I was muddling through some wikipedia link on search algorithms and found this:
Oz: Hash tables are also used for list search, requiring only constant time for search in the average case, but more space overhead and terrible O(n) worst-case search time. Another search based on specialized data structures uses self-balancing binary search trees and requires O(log n) time to search; these can be seen as extending the main ideas of binary search to allow fast insertion and removal. See associative array for more discussion of list search data structures.
Oz: I nearly hit the floor shivering in horror from big o flashbacks
Uncle Pauly: That's what she said