CS Algorithms Circle

4 questions

LeetCode grinding, interview prep, and algorithm deep-dives. Weekly problem sets with solution discussions on Sundays.

Why is binary search O(log n) and not O(n/2)?
3 answers
Is dynamic programming just memoised recursion with extra steps?
3 answers
Why is a hash table lookup called O(1) when collisions exist?
4 answers
If mergesort is O(n log n) always, why is quicksort usually faster?
3 answers