000			02065nam a22002057a 4500
999			_c1573 _d1573
003			OSt
005			20200423120622.0
008			200422b mp ||||| |||| 00| 0 mon d
020			_a9780262033848
040			_cШМТДС
082			_222 _a005.1 _bC-80
100			_d Thomas H. Cormen
245			_aIndroduction to Algorithms
300			_c240см.
500			_aSome books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible 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.
505			_aSome books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible 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. _tThe Role of Algorithms in Computing _tProbabilisttic Analysis and Randomized Algorithms _tSorting and Order Statistics _tData Structures _tAdvansed Design and Analysis techniques _tAdvansed data Structures _tGraph Algorithms _tMathematical Background
653			_aAlgorithms _aThe Role of Algorithms in Computing _aData Structures _aGraph Algorithms _aMathematical Background
700			_eCharles E.Leiserson _eRonald L.Riverst _eClifford Steim
942			_2ddc _cBK