3 docs tagged with "divide-and-conquer"

Independent recursive subproblems, combine costs, and recurrence-based analysis.

Stable divide-and-conquer sorting with predictable runtime and linear array workspace.

Partition-based sorting, pivot risk, duplicate handling, and stack discipline.