Introduction to algorithms
- Utgiven: 1990
- ISBN: 9780262031417
- Förlag: McGraw-Hill
- Format: Bok
- Språk: Engelska
Om boken
There are books on algorithms that are rigorous but not complete and
books that cover masses of material but are not rigorous.
Introduction to Algorithms combines the attributes of
comprehensiveness and comprehensibility. It will be equally useful as a
text, a handbook, and a general reference.
Introduction to Algorithms covers both classical material and
such modern developments as amortized analysis and parallel algorithms.
The mathematical exposition, while rigorous, is carefully detailed so
that it will be accessible to all levels of readers. Chapters are
organized so that they start with elementary material and progress to
more advanced topics.
Each chapter is relatively self-contained and can be used as a unit of
study. Algorithms are presented in a pseudocode that can be easily read
by anyone familiar with Fortran, C, or Pascal. Numerous pertinent
examples, figures, exercises, and case-study problems emphasize both
engineering and mathematical aspects of the subject.
Åtkomstkoder och digitalt tilläggsmaterial garanteras inte med begagnade böcker
Mer om Introduction to algorithms (1990)
1990 släpptes boken Introduction to algorithms skriven av Cormen, Thomas H., Leiserson, Charles E., Rivest, Ronald L.. Den är skriven på engelska. Förlaget bakom boken är McGraw-Hill som har sitt säte i New york.
Köp boken Introduction to algorithms på Studentapan och spara pengar.
Referera till Introduction to algorithms
Harvard
Cormen, Leiserson, T. H. ;, Rivest, C. E. ; & L., R. (1990). Introduction to algorithms. McGraw-Hill.
Oxford
Cormen, Leiserson, Thomas H.;, Rivest, Charles E.; & L., Ronald, Introduction to algorithms (McGraw-Hill, 1990).
APA
Cormen, Leiserson, T. H. ;, Rivest, C. E. ;, & L., R. (1990). Introduction to algorithms. McGraw-Hill.
Vancouver
Cormen, Leiserson TH;, Rivest CE;, L. R. Introduction to algorithms. McGraw-Hill; 1990.
