O'Reilly logo

Advanced Topics in C: Core Concepts in Data Structures by Noel Kalicharan

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

CHAPTER 11

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

11.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 ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required