Data Structures and Algorithms Made Easy
CCCCCCCChhhhhhhhaaaaaaaapppppppptttttttteeeeeeeer rr r r rr r 1111111122222222
EEEEEEEEAAAAAAAARRRRRRRRCCCCCCCCHHHHHHHHIIIIIIIINNNNNNNNGGGGGGGG What isWhat isWhat isWhat is searchingsearchingsearchingsearching????
In computer science, searching is the process of finding an item with specified propertiesamong a collection of items. The items may be stored as records in a database, simple dataelements in arrays, text in files, nodes in trees, vertices and edges in graphs or may beelements of other search space.
Why Searching?Why Searching?Why Searching?Why Searching?
Searching is one of core computer science algorithms. We know that today’s computersstores lot of information. To retrieve this information efficiently we need very efficientsearching algorithms.There are certain ways of organizing the data which improves the searching process. Thatmans, if we keep the data in some proper order then it is easy to search the required element.Sorting is one of the techniques for making the elements ordered.In this chapter we will see different searching algorithms.
Types of SearchingTypes of SearchingTypes of SearchingTypes of Searching
The following are the types of searches which we will be discussing in this book.
Unordered Linear Search
Sorted/Ordered Linear Search
Symbol Tables and Hashing
String Searching Algorithms: Tries, Ternary Search and Suffix Trees
UnorderedUnorderedUnorderedUnordered Linear SearchLinear SearchLinear SearchLinear Search