7 docs tagged with "divide-and-conquer"

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.

Learn about Merge Sort, a stable divide-and-conquer sorting algorithm that guarantees O(n log n) performance in all cases.

Learn about Quick Sort, one of the most efficient sorting algorithms using divide-and-conquer with an average O(n log n) time complexity.

Strassen's matrix multiplication is an efficient algorithm that reduces the time complexity of multiplying two matrices.

A divide-and-conquer algorithm for finding the maximum or minimum of a unimodal function by partitioning the search space into three parts.