Algorithm Design

← Back to Domain-Specific Abstractions by Domain

2 domain-specific abstractions whose origin domain is Algorithm Design.

• Divide-and-conquer algorithm — Solve a problem by splitting each non-base instance into smaller related subproblems, solving those recursively, and combining their results into the original answer.
• Prune and search — An optimization technique that repeatedly discards a guaranteed constant fraction of candidate input while preserving at least one optimum, then recurses on the remainder.