Tutorialspoint.dev

Introduction To

Searching Algorithms

Search Algorithms is any algorithm which solves the search problem, namely, to retrieve information stored within some data structure, or calculated in the search space of a problem domain, either with discrete or continuous values. 

These Algorithms are often evaluated by their computational complexity, or maximum theoretical run time. Binary search functions, for example, have a maximum complexity of O(log n), or logarithmic time. This means that the maximum number of operations needed to find the search target is a logarithmic function of the size of the search space.

 

Course Structure

Coding Problems

Subscribe to Our Newsletter