Optimal splitting and tree structure shape algorithm performance. This book introduces practical tools for analyzing how recurrences describe the running time of divide-and-conquer algorithms. It connects differences, convexity, and concavity to the way work is distributed as n grows, and shows how to frame these ideas with binary trees.
Two clear sections frame the value: first, a set of theorems that describe when simple, balanced structures minimize cost; and second, a deeper look at how different tree shapes—balanced or heap-like—affect the f-sum and the overall solution to core recurrence relations. Throughout, the text stays focused on concrete results and their implications for algorithm design.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Vendeur : Forgotten Books, London, Royaume-Uni
Paperback. Etat : New. Print on Demand. This book delves into the complexities of recurrence relations that arise within divide and conquer algorithms, challenging the commonly held notion known as the "Balancing Principle." The author meticulously examines scenarios where the principle stands valid, discerning that it holds true when the function representing the cost of combining solutions, denoted as f, exhibits convexity. However, when f demonstrates concavity, an optimal solution is achieved by deliberately introducing imbalance. The author meticulously formulates recurrence relations to express the time complexity of divide and conquer algorithms, establishing a functional equation framework for analysis. Through the study of convex and concave functions, the book illuminates the conditions under which the Balancing Principle remains valid. Expanding on this, the author presents a strategy for solving recurrence relations involving concave functions, thereby revealing that the optimal strategy in such cases involves unbalancing rather than maintaining equal-sized subproblems. This book significantly contributes to the theoretical understanding of algorithm analysis, particularly in the context of divide and conquer approaches. Its insights challenge conventional wisdom and provide valuable guidance for researchers and practitioners seeking to optimize the performance of algorithms. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item. N° de réf. du vendeur 9781332869916_0
Quantité disponible : Plus de 20 disponibles
Vendeur : PBShop.store US, Wood Dale, IL, Etats-Unis
PAP. Etat : New. New Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur LW-9781332869916
Quantité disponible : 15 disponible(s)
Vendeur : PBShop.store UK, Fairford, GLOS, Royaume-Uni
PAP. Etat : New. New Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur LW-9781332869916
Quantité disponible : 15 disponible(s)
Vendeur : Revaluation Books, Exeter, Royaume-Uni
Paperback. Etat : Brand New. 30 pages. 9.21x5.98x0.10 inches. This item is printed on demand. N° de réf. du vendeur zk1332869912
Quantité disponible : 1 disponible(s)