Introduction to Data Structures in C

Chapter 11

Searching

Chapter Outline

11.1 Introduction

11.2 Searching

11.3 Linear (Sequential) Search

11.4 Binary Search

11.5 Hashing Method

11.6 Hashing Function

11.7 Division Method

11.8 Mid-Square Method

11.9 Folding Method

11.10 Length-dependent Method

11.11 Multiplicative Hashing Function

11.12 Digit Analysis Method

11.1 INTRODUCTION

In our day-to-day life there are various applications, in which the process of searching is to be carried. Searching a name of a person from the given list, searching a specific card from the set of cards, etc., are few examples of searching.

A typical example where searching technique is applied is personal telephone diary. This diary is used to store phone / mobile numbers of friends, relatives, etc. For ...