Introduction to Algorithms
Algorithm is a basic need to develop any program. Without Algorithm you don't get wide ideas about work and how to do. Algorithm also helps in code understanding and compaction. So, If you are a student of computer science , You must have knowledge of algorithm as how to create algorithm, how to analyze algorithm.
'Introduction to Algorithms' is an important book to learn Algorithm basics and advances. This is a large book, and your class will probably cover only a portion of its material. The witers have tried, however, to make this a book that will be useful to you now as a course textbook and also later in your career as a mathematical desk reference or an engineering handbook.
This book provides a comprehensive introduction to the modern study of computer algorithms. It presents many algorithms and covers them in considerable depth, yet makes their design and analysis accessible to all levels of readers. Each chapter presents an algorithm, a design technique, an application area, or a related topic. Algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The book contains 244 figure many with multiple parts illustrating how the algorithms work..
You can download free Pdf of Introduction to Algorithms book or e-book, by clicking on "Download free PDF"
Name of the book :- Introduction to Algorithms
Writers :- Thomas H. Coremen, Charles E. Leiserson, Ronad L. Rivest, Clifford Srein .
Publisher :- The MIT Press.
Language :- English
Subject :- Algorithm
File Type :- PDF
File Size :- 4.85 Mb