gogogo
Syndetics cover image
Image from Syndetics

Introduction to algorithms / Thomas H. Cormen ... [et al.].

By: Contributor(s): Material type: TextTextPublication details: Cambridge, Mass. : MIT Press ; Boston : McGraw-Hill, c2001.Edition: 2nd edDescription: xxi, 1180 p. : ill. ; 24 cmISBN:
  • 0262032937 (hc. : alk. paper)
  • 0262531968
Subject(s): DDC classification:
  • 518.1 COR
Holdings
Item type Current library Call number Copy number Status Date due Barcode
Standard Loan Moylish Library Main Collection 518.1 COR (Browse shelf(Opens below)) 1 Available 39002000355744
Standard Loan Thurles Library Main Collection 005.1 COR (Browse shelf(Opens below)) Available R08642KRCT
Standard Loan Thurles Library Main Collection 005.1 COR (Browse shelf(Opens below)) Available R08430KRCT
Standard Loan Thurles Library Main Collection 005.1 COR (Browse shelf(Opens below)) Available R08311KRCT

Enhanced descriptions from Syndetics:

This title covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor.

Introduction to Algorithms uniquely combines rigor and comprehensiveness. The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming

Includes bibliographical references (p. [1127]-1143) and index.

English.

Table of contents provided by Syndetics

  • Preface (p. xiii)
  • I Foundations
  • Introduction (p. 3)
  • 1 The Role of Algorithms in Computing (p. 5)
  • 2 Getting Started (p. 15)
  • 3 Growth of Functions (p. 41)
  • 4 Recurrences (p. 62)
  • 5 Probabilistic Analysis and Randomized Algorithms (p. 91)
  • II Sorting and Order Statistics
  • Introduction (p. 123)
  • 6 Heapsort (p. 127)
  • 7 Quicksort (p. 145)
  • 8 Sorting in Linear Time (p. 165)
  • 9 Medians and Order Statistics (p. 183)
  • III Data Structures
  • Introduction (p. 197)
  • 10 Elementary Data Structures (p. 200)
  • 11 Hash Tables (p. 221)
  • 12 Binary Search Trees (p. 253)
  • 13 Red-Black Trees (p. 273)
  • 14 Augmenting Data Structures (p. 302)
  • IV Advanced Design and Analysis Techniques
  • Introduction (p. 321)
  • 15 Dynamic Programming (p. 323)
  • 16 Greedy Algorithms (p. 370)
  • 17 Amortized Analysis (p. 405)
  • V Advanced Data Structures
  • Introduction (p. 431)
  • 18 B-Trees (p. 434)
  • 19 Binomial Heaps (p. 455)
  • 20 Fibonacci Heaps (p. 476)
  • 21 Data Structures for Disjoint Sets (p. 498)
  • VI Graph Algorithms
  • Introduction (p. 525)
  • 22 Elementary Graph Algorithms (p. 527)
  • 23 Minimum Spanning Trees (p. 561)
  • 24 Single-Source Shortest Paths (p. 580)
  • 25 All-Pairs Shortest Paths (p. 620)
  • 26 Maximum Flow (p. 643)
  • VII Selected Topics
  • Introduction (p. 701)
  • 27 Sorting Networks (p. 704)
  • 28 Matrix Operations (p. 725)
  • 29 Linear Programming (p. 770)
  • 30 Polynomials and the FFT (p. 822)
  • 31 Number-Theoretic Algorithms (p. 849)
  • 32 String Matching (p. 906)
  • 33 Computational Geometry (p. 933)
  • 34 NP-Completeness (p. 966)
  • 35 Approximation Algorithms (p. 1022)
  • VIII Appendix: Mathematical Background
  • Introduction (p. 1057)
  • A Summations (p. 1058)
  • B Sets, Etc. (p. 1070)
  • C Counting and Probability (p. 1094)
  • Bibliography (p. 1127)
  • Index (p. 1145)

Author notes provided by Syndetics

Thomas H. Cormen received a Ph. D. from MIT in 1992. He is an associate professor at Dartmouth College.

Cormen is one of the authors of Introduction to Algorithms.

(Bowker Author Biography)

Powered by Koha