How evenly should one divide to conquer quickly?

DOI10.1016/0020-0190(84)90086-3zbMath0549.68034OpenAlexW2046561758MaRDI QIDQ800084

Timothy R. S. Walsh

Publication date: 1984

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(84)90086-3

zbMATH Keywords

balancingtime complexitydivide-and-conquerbalanced divisionmerge-sorting algorithmrecursion vs. iteration

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)

Related Items (2)

An asymptotic theory for recurrence relations based on minimization and maximization. ⋮ Divide-and-conquer recurrences associated with generalized heaps, optimal merge, and related structures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: How evenly should one divide to conquer quickly?