Introduction to Algorithms
por
There are books on algorithms that are rigorous but not complete and books that cover masses of material but are not rigorous. Introduction to Algorithms combines the attributes of comprehensiveness and comprehensibility. It will be equally useful as a text, …
- ● 13 readers
- ● 76% match for you
the long version
There are books on algorithms that are rigorous but not complete and books that cover masses of material but are not rigorous. Introduction to Algorithms combines the attributes of comprehensiveness and comprehensibility. It will be equally useful as a text, a handbook, and a general reference.Introduction to Algorithms covers both classical material and such modern developments as amortized analysis and parallel algorithms. The mathematical exposition, while rigorous, is carefully detailed so t
Margaret's verdict
"There are books on algorithms that are rigorous but not complete and books that cover masses of material but are not rigorous. Introduction to Algorithms combines the attributes of comprehensiveness …"
highlights
what readers held onto
No highlights yet. Be the first.
discussion
what readers said
No reviews yet. Finish it; tell us what you found.