Download Our App
Thomas H. Cormen's Introduction to Algorithms Second Edition
Introduction to Algorithms is a complete book for Design and Analysis of algorithms generally known as DAA. Algorithm analysis is an important part of a broader computational complexity theory, which provides theoretical estimates for the resources needed by any algorithm which solves a given computational problem. These estimates provide an insight into reasonable directions of search for efficient algorithms.
Chapter List
Chapter 1: The Role of Algorithms in Computing
Chapter 2: Getting Started
Chapter 3: Growth of Functions
Chapter 4: Recurrences
Chapter 5: Probabilistic Analysis and Randomized Algorithms
What are algorithms? Why is the study of algorithms worthwhile? What is the role of
algorithms relative to other technologies used in computers? Are the basic questions being answered in the first section of the Book.
Campus News & Events
-
Study materialColleges are sharing lecture notes, study material, file, assignment etc. -
Educational videosCollege student sharing a great video to help peers study. -
Previous Year PapersAccess previous year papers for various courses. -
Clarify DoubtsAsk any study related doubt and get answered by college students and faculty.
Info. update by students of the respective college only.
