Skip to Main Content
Introducing Data Structures with Java
book

Introducing Data Structures with Java

by David Cousins
March 2013
Intermediate to advanced content levelIntermediate to advanced
416 pages
9h 41m
English
Pearson Education India
Content preview from Introducing Data Structures with Java

7

Hashing and Hash Tables

Hash Tables Hash Tables

Contents

  • Alternative means of accessing arrays
  • Hashing algorithms and hash tables
7.1 INTRODUCTION

In Chapter 6, we considered two methods for locating items in an array, depending upon whether or not it is in sorted order. The Big-O relationship was established for binary and linear searches. There is an alternative means of organizing an array so that an item may be retrieved ‘directly’ from its location. This makes the operation more efficient, even more so than binary search. In this chapter, we examine this model and its potential advantages.

7.2 AN ALTERNATIVE ARRAY STORAGE MODEL

Imagine a small ...

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Data Structures and Algorithms Using Java

Data Structures and Algorithms Using Java

William McAllister

Publisher Resources

ISBN: 9788131758649