TY  - BOOK
AU  - Brassard, Gilles   
AU  - Bratley,  Paul 
TI  - Fundamentals of algorithmics
SN  - 9788120311312 
U1  - 511.8 
PY  - 1999///
CY  - New Delhi
PB  - Prentice-Hall
KW  - Algorithms
N1  - 	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
N2  - 	
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
ER  -