Data Structures and Algorithms for Beginners
About Lesson

Searching is a way of finding an element in a given list of elements. A list of elements could be represented as an Array, Linked list, Binary tree, and Heap.

The elements could also be stored in a file.

The searching technique should find the element as quickly as possible. Sometimes, it is necessary to search a list of records to identify a particular record.

The complexity of any search algorithm depends on the number of comparisons required to find the element.

The performance of the search algorithm can be found by counting the number of comparisons to find the given element.