정보
- ISBN : 0262033844
- 출판사 : Mit Pr
- 출판일 : 20091101
- 저자 : Cormen, Thomas H. (EDT)/ Leiserson, Charles E./ Rivest, Ronald L./ Stein, Clifford
요약
● Some books on algorithms are rigorous but incomplete others cover masses of material but lack 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 …
SOME BOOKS ON ALGORITHMS ARE RIGOROUS BUT INCOMPLETE OTHERS COVER MASSES OF MATERIAL BUT LACK RIGOR. INTRODUCTION TO ALGORITHMSUNIQUELY COMBINES RIGOR AND COMPREHENSIVENESS. THE BOOK COVERS A BROAD RANGE OF ALGORITHMS IN DEPTH, YET MAKES THEIR DESIGN AND ANALYSIS ACCESSIBLE…
Introduction to Algorithms (Hardcover/ 3rd Ed.)