This is an introductory-level algorithm text. It includes worked-out examples and detailed proofs. Presents Algorithms by type rather than application.* structures material by techniques employed, not by the application area, so students can progress from the underlying abstract concepts to the concrete application essentials. * begins with a compact, but complete introduction to some necessary math, and also includes a long introduction to proofs by contradiction and mathematical induction. This serves to fill the gaps that many undergraduates have in their mathematical knowledge. * gives a paced, thorough introduction to the analysis of algorithms, and uses coherent notation and unusually detailed treatment of solving recurrences. * includes a chapter on probabilistic algorithms, and an introduction to parallel algorithms, both of which are becoming increasingly important. * approaches the analysis and design of algorithms by type rather than by application.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
For departments of computer science offering Sophomore through Junior-level courses in Algorithms or Design and Analysis of Algorithms.
This is an introductory-level algorithm text. It includes worked-out examples and detailed proofs. Presents Algorithms by type rather than application.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
EUR 7,18 expédition depuis Royaume-Uni vers France
Destinations, frais et délaisVendeur : Anybook.com, Lincoln, Royaume-Uni
Etat : Fair. This is an ex-library book and may have the usual library/used-book markings inside.This book has soft covers. In fair condition, suitable as a study copy. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,850grams, ISBN:9780130734877. N° de réf. du vendeur 8446373
Quantité disponible : 1 disponible(s)