Back to All Flashcards
Card 1 of 5 0%
0Hard
0Learning
0Know It
Question
Loading…
Click to reveal answer
Answer
All 5 Cards
#1
Q: Time complexity of binary search?
A: O(log n)
#2
Q: What is a stack?
A: LIFO (Last In First Out) data structure. Push adds, pop removes from the top.
#3
Q: Difference between BFS and DFS?
A: BFS explores level by level (queue). DFS goes deep first (stack/recursion).
#4
Q: What is Big-O notation?
A: Describes the worst-case time or space complexity of an algorithm as input size grows.
#5
Q: Time complexity of merge sort?
A: O(n log n)
Explore All 125 Free Decks