Introduction to the design & analysis of algorithms / Anany Levitin
Material type: TextLanguage: English Publication details: Boston : Pearson Addison-Wesley, c2007Edition: 2nd edDescription: xxiii, 562 p. : ill. ; 24 cmISBN: 9780321358288 (alk. paper); 0321364139 (pbk.); 9780321364135 (pbk.)Other title: Introduction to the design and analysis of algorithmsSubject(s): Computer algorithmsDDC classification: 005.1 LOC classification: QA76.9.A43 | L48 2007Item type | Current library | Home library | Call number | Status | Notes | Date due | Barcode | Item holds |
---|---|---|---|---|---|---|---|---|
Books | BUC | BUC | 005.1 LAI (Browse shelf (Opens below)) | Available | 13133 | |||
Books | BUC | BUC | 005.1 LAI (Browse shelf (Opens below)) | Available | 13134 | |||
Books | BUC | BUC | 005.1 LAI (Browse shelf (Opens below)) | Available | 13135 | |||
Books | BUC | BUC | 005.1 LAI (Browse shelf (Opens below)) | Available | 13136 | |||
Books | BUC | BUC | 005.1 LAI (Browse shelf (Opens below)) | Available | 13137 | |||
Books | BUC | BUC | 005.1 LAI (Browse shelf (Opens below)) | Available | 13138 | |||
Books | BUC | BUC | 005.1 LAI (Browse shelf (Opens below)) | Available | 13139 | |||
Books | BUC | BUC | 005.1 LAI (Browse shelf (Opens below)) | Available | 13140 | |||
Books | BUC | BUC | 005.1 LAI (Browse shelf (Opens below)) | Available | C - 70 | 13141 | ||
Books | BUC | BUC | 005.1 LAI (Browse shelf (Opens below)) | Available | C - 70 | 13142 | ||
Books | BUC | BUC | 005.1 LAI (Browse shelf (Opens below)) | Available | 13143 | |||
Books | BUC | BUC | 005.1 LAI (Browse shelf (Opens below)) | Available | 13144 | |||
Books | BUC | BUC | 005.1 LAI (Browse shelf (Opens below)) | Available | 13145 | |||
Books | BUC | BUC | 005.1 LAI (Browse shelf (Opens below)) | Available | C - 70 | 13146 | ||
Books | BUC | BUC | 005.1 LAI (Browse shelf (Opens below)) | Available | 13147 |
Browsing BUC shelves Close shelf browser (Hides shelf browser)
Includes bibliographical references (p. 487-496) and index
Introduction -- Fundamentals of the Analysis of Algorithm Efficiency -- Brute Force -- Divide-and-Conquer -- Decrease-and-Conquer -- Transform-and-Conquer -- Space and Time Tradeoffs -- Dynamic Programming -- Greedy Technique -- Iterative Improvement -- Limitations of Algorithm Power -- Coping with the Limitations of Algorithm Power
There are no comments on this title.