Back to marketplace
2.3.4 average time complexities of different searching algorithms
No description yet. This curated deck is ready for daily study.
Total cards: 5•Content version: v4•Public deck•Updated: 8/1/2026
Card preview (5)
#1
Front (Question)
Linear search
Back (Answer)
O(n) Worst case is O(n) Best case is O(1) (finding it instantly)
#2
Front (Question)
Binary search (array)
Back (Answer)
O(log(n)) Worst case is O(log(n)) Best case is O(1)
#3
Front (Question)
Binary search (tree)
Back (Answer)
O(log(n)) Worst case is O(n) Best case is O(1)
#4
Front (Question)
Hashing
Back (Answer)
O(1) Worst case is O(n) Best case is O(1)
#5
Front (Question)
Breadth/depth first of graph
Back (Answer)
O(V+E) (number of vertices + number of edges) Worst case is O(V^2) (number of vertices, squared) Best case is O(1)