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.
- ISBN10 013073487X
- ISBN13 9780130734877
- Publish Date 6 September 1995
- Publish Status Out of Print
- Out of Print 17 October 2003
- Publish Country US
- Imprint Pearson
- Format Paperback
- Pages 524
- Language English