CampusFlow
DSASearching

Searching Algorithms

Visualize Linear and Binary search step by step.

0

Comparisons

default
comparing
found
eliminated
range
3
6
12
12
20
18
28
48
45
60
55
36
52
98
75
64

Linear Search

Time ComplexityO(n)
Space ComplexityO(1)
Sorted ArrayNot required
Best CaseO(1)
Worst CaseO(n)

Binary Search

Time ComplexityO(log n)
Space ComplexityO(1)
Sorted ArrayRequired
Best CaseO(1)
Worst CaseO(log n)