Search results

Create the page "Hash table" on this wiki! See also the search results found.

• Optimization
  ...her something belongs to this set, we can represent the set using a [[hash table]] and thus perform this check in constant time rather than linear time. ...on a [[balanced binary search tree]] or [[skip list]], rather than a hash table. This gets the job done in logarithmic time—still much better than li
  7 KB (1,155 words) - 01:34, 5 January 2012
• Shortest path
  ...g when a vertex has been visited both forward and backward, such as a hash table.
  18 KB (3,150 words) - 07:09, 26 May 2011
• Data structure
  ...any ways of implementing these, such as by [[binary search tree]]s, [[hash table]]s, or [[skip list]]s, but the language standard usually does not specify ' * '''[[Symbol table|Set data structures]]''', or '''symbol tables''', maintain sets (collection
  9 KB (1,544 words) - 02:06, 20 March 2011
• String searching
  ...By comparing the hash of each of these substrings of the haystack with the hash of the needle, we can rule out many positions in the haystack (''i.e.'', wh ...hes ''any'' of the needle hashes. By storing the needle hashes in a [[hash table]], we obtain linear time.
  16 KB (2,766 words) - 19:54, 6 April 2011
• Rabin–Karp algorithm
  ...e needle in the haystack in linear time. Together with the use of a [[hash table]], it can also find all probable matches for multiple needles in one haysta ...s its argument and returns a relatively small amount of data, called the ''hash'', which may be compared more quickly or easily. So we can rewrite the naiv
  9 KB (1,664 words) - 16:33, 29 May 2011
• Map
  ===Hash table=== ...e, which is significant because every map operation requires computing the hash of the key.
  13 KB (2,270 words) - 18:16, 25 February 2012
• Prefix sum array and difference array
  ...es in the array. Total time taken is <math>O(N)</math>, if we use a [[hash table]] implementation of the map.
  25 KB (4,594 words) - 23:35, 19 December 2023