Chapter: Searching

Searching is a basic operation used in many calculation problems, wherever an element or information has to be found in a big number of items stored before. In general, searching involves datasets, each having a key. The goal of a search operation is to find a dataset having a specific key.

The most common data structures used in searching are: * tables, * trees and * files. The obvious application of a search operation is to be used with some different other operations like:

initialize (the dataset) insert delete read update

  1. Algorithm: Sequential Search

Thank you to the contributors under CC BY-SA 4.0!