3 docs tagged with "divide-and-conquer"

This document provides an overview of the Convex Hull problem using the divide-and-conquer approach.

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.