Divide & Conquer Problems
Divide & Conquer algorithms: recursion, binary splitting, and efficient sorting.
Filter by difficulty:
All
Easy
Medium
Hard
Basic Problems
•
Power(x, n) – Compute xⁿ in O(log n)
Medium
Solution
•
Square Root (Sqrt(x)) – Compute √x in O(log n)
Medium
Solution
Sorting
•
Merge Sort – Sort array in O(n log n)
Medium
Solution