The book covers a broad range of algorithms in depth, yet makes their design and analysis acessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor.
%0 Book
%1 cormen01
%A Cormen, Thomas H.
%A Leiserson, Charles E.
%A Rivest, Ronald L.
%A Stein, Clifford
%C Cambridge, MA
%D 2001
%I MIT Press
%K aks algorithm clrs gadget no.pdf np-hardness quicksort shellsort sorting sorting.network textbook
%T Introduction to Algorithms
%X The book covers a broad range of algorithms in depth, yet makes their design and analysis acessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor.
%7 Second
%@ 0262032937 9780262032933 0070131511 9780070131514 0262531968 9780262531962
@book{cormen01,
abstract = {The book covers a broad range of algorithms in depth, yet makes their design and analysis acessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor.},
added-at = {2016-11-02T13:28:03.000+0100},
address = {Cambridge, MA},
author = {Cormen, Thomas H. and Leiserson, Charles E. and Rivest, Ronald L. and Stein, Clifford},
biburl = {https://www.bibsonomy.org/bibtex/2225d42638921bee01b4ac8ff991b0a6a/ytyoun},
edition = {Second},
interhash = {dcdeb0ec50a6798abf1724056982b543},
intrahash = {225d42638921bee01b4ac8ff991b0a6a},
isbn = {0262032937 9780262032933 0070131511 9780070131514 0262531968 9780262531962},
keywords = {aks algorithm clrs gadget no.pdf np-hardness quicksort shellsort sorting sorting.network textbook},
publisher = {MIT Press},
refid = {46792720},
timestamp = {2017-06-15T02:34:29.000+0200},
title = {Introduction to Algorithms},
year = 2001
}