⚡
DSA Visualizer
🇺🇸 EN
🇧🇷 PT
← Back
Searching
Algorithms for finding elements in data structures
Linear Search
Best:
O(1)
Avg:
O(n)
Space:
O(1)
simple
unsorted
Binary Search
Best:
O(1)
Avg:
O(log n)
Space:
O(1)
sorted
divide-and-conquer
efficient
Breadth-First Search
Best:
O(V+E)
Avg:
O(V+E)
Space:
O(V)
graph
level-order
shortest-path
Depth-First Search
Best:
O(V+E)
Avg:
O(V+E)
Space:
O(V)
graph
recursive
backtracking