- Main
- Computers - Algorithms and Data Structures
- Introduction to Algorithms
Introduction to Algorithms
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford SteinHow much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
A comprehensive update of the leading algorithms text, with new material on matchings in bipartite graphs, online algorithms, machine learning, and other topics. Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. It covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers, with self-contained chapters and algorithms in pseudocode.
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. This fourth edition has been updated throughout.
New for the fourth edition• New chapters on matchings in bipartite graphs, online algorithms, and machine learning• New material on topics
including solving recurrence equations, hash tables, potential
functions, and suffix arrays• 140 new exercises and 22 new problems•
Reader feedback–informed improvements to old problems• Clearer, more
personal, and gender-neutral writing style• Color added to improve
visual presentation• Notes, bibliography, and index updated to reflect
developments in the field• Website with new supplementary material
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. This fourth edition has been updated throughout.
New for the fourth edition• New chapters on matchings in bipartite graphs, online algorithms, and machine learning• New material on topics
including solving recurrence equations, hash tables, potential
functions, and suffix arrays• 140 new exercises and 22 new problems•
Reader feedback–informed improvements to old problems• Clearer, more
personal, and gender-neutral writing style• Color added to improve
visual presentation• Notes, bibliography, and index updated to reflect
developments in the field• Website with new supplementary material
Categories:
Year:
2022
Edition:
4th
Publisher:
MIT Press
Language:
english
Pages:
1312
ISBN:
2021037260
File:
PDF, 15.35 MB
Your tags:
IPFS:
CID , CID Blake2b
english, 2022
Read Online
- Download
- pdf 15.35 MB Current page
- Checking other formats...
- Convert to
- Unlock conversion of files larger than 8 MBPremium
The file will be sent to your email address. It may take up to 1-5 minutes before you receive it.
The file will be sent to you via the Telegram messenger. It may take up to 1-5 minutes before you receive it.
Note: Make sure you have linked your account to Z-Library Telegram bot.
The file will be sent to your Kindle account. It may take up to 1–5 minutes before you receive it.
Please note: you need to verify every book you want to send to your Kindle. Check your mailbox for the verification email from Amazon Kindle.
Conversion to is in progress
Conversion to is failed
Premium benefits
- Send to eReaders
- Increased download limit
- File converter
- More search results
- More benefits