000			01272nam a2200181 a 4500
020			_a9788120311312
020			_a8120311310
082			_a511.8 _bBRA
100			_aBrassard, Gilles
245			_aFundamentals of algorithmics
260			_aNew Delhi: _bPrentice-Hall, _c1999.
300			_axix, 524 pages : _billustrations ;
505			_a Preliminaries -- Elementary algorthmics -- Asymptotic notation -- Analysis of algorthms -- Some data structures -- Greedy algorithms -- Divide-and-conquer -- Dynamic programming -- Exploring graphs -- Probabilistic algorithms -- Parallel algorithms -- Computational complexity -- Heuristic and approximate algorithms.
520			_a This is an introductory-level algorithm book. It includes worked-out examples and detailed proofs. Presents Algorithms by type rather than application. Includes structured material by techniques employed, not by the application area, so readers can progress from the underlying abstract concepts to the concrete application essentials. It begins with a compact, but complete introduction to some necessary math. And it approaches the analysis and design of algorithms by type rather than by application
650			_aAlgorithms.
700			_aBratley, Paul
942			_cREF
999			_c13797 _d13797