Convex Hull Problem
This document provides an overview of the Convex Hull problem using the divide-and-conquer approach.
This document provides an overview of the Convex Hull problem using the divide-and-conquer approach.
Solving the Find a Peak Element II problem using Binary Search on a 2D Matrix.
Maximum minimum finding using divide and conquer approach to reduce the number of comparisions.
Strassen's matrix multiplication is an efficient algorithm that reduces the time complexity of multiplying two matrices.