Search algorithm: Difference between revisions

Content deleted Content added
MOS:CAPS
Line 15:
Algorithms are often evaluated by their [[computational complexity]], or maximum theoretical run time. Binary search functions, for example, have a maximum complexity of {{math|''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.
 
== Applications of Searchsearch Algorithmsalgorithms ==
Specific applications of search algorithms include: