CHAPTER 10

image

Hashing

In this chapter, we will explain the following:

  • The fundamental ideas on which hashing is based
  • How to solve the search and insert problem using hashing
  • How to delete an item from a hash table
  • How to resolve collisions using linear probing
  • How to resolve collisions using quadratic probing
  • How to resolve collisions using chaining
  • How to resolve collisions using linear probing with double hashing
  • How to link items in order using arrays

10.1 Hashing Fundamentals

Searching for an item in a (large) table is a common operation in many applications. In this chapter, we discuss hashing, a fast method for performing this search. The ...

Get Advanced Topics in Java: Core Concepts in Data Structures now with the O’Reilly learning platform.

O’Reilly members experience live online training, plus books, videos, and digital content from nearly 200 publishers.