₹2,549
₹5,399
52% OffHurry Up, Shop Now!
0H:0M:0S
Final Price inclusive of all taxes
Cash on Delivery
Free Delivery
Get it delivered in 3-6 days
size
21.29 x 5.72 x 23.65 cm
Product Information
Ideal For
General Readers, Fiction Lovers, Mythology & Historical Fiction Readers, Indian Mythology Enthusiasts, Young Adults (YA) & Adults, College Students, Competitive Exam Aspirants (General Reading / Culture), Gift Purpose (Books Gift Set), Spiritual & Philosophy Interest Readers, Library / Book Collection Buyers
Country Of Origin
India
About Author
Thomas H. Cormen Is Emeritus Professor And Former Chair Of The Dartmouth College Department Of Computer Science And Former Director Of The Dartmouth College Institute For Writing And Rhetoric. He Received The B.S.E. Degree In Electrical Engineering And...
Author Name
Thomas H. Cormen
Genre
Higher Education Textbooks
No Of Pages
1312
Publisher
Mit Press
Isbn Code
9.78E+12
Product Description
- Premium Quality: Introduction to Algorithms uniquely combines rigor and comprehensiveness, covering a broad range of algorithms in depth while making their design and analysis accessible to all levels of readers.
- Product Design: The book features self-contained chapters and algorithms presented in pseudocode, ensuring clarity and ease of understanding for students and professionals alike.
- User Experience: Since the publication of the first edition, Introduction to Algorithms has become the leading algorithms text in universities worldwide as well as the standard reference for professionals.
- Versatile Occasion: This fourth edition has been updated throughout, making it equally valuable as a university textbook, a professional reference, and a rigorous self-study resource.
- Quality Craftsmanship: Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor - Introduction to Algorithms stands apart by delivering both in a single authoritative volume.
- Lifestyle Essential: Spanning 1,312 pages, this essential computer science paperback is an indispensable addition to the library of any student, educator, or software professional serious about algorithms.