Brassard, Gilles, <br/><br/>
Fundamentals of algorithmics / 
Gilles Brassard, Paul Bratley. 
 - Englewood, N.J. :  Prentice Hall,  c1996. 
 - xix, 524 p. :  ill. ;  25 cm. 
<br/><br/>Preliminaries (Page-1), Elementary Algorithmic (Page-57), Asymptotic Notation (Page-79), Analysis of Algorithms(Page-98), Some Data Structures(Page-147), Greedy Algorithms (Page-187), Divide-and-Conquer(Page-219), Dynamic Programming(Page-259), Exploring Graphs (Page-285), Probabilistic Algorithms (Page-328), Parallel Algorithms (Page-376), Computational Complexity (Page-413), Heuristic and Approximate Algorithms (Page-474). 
<br/><br/><label>ISBN: </label>013073487x 
<br/><br/><label>LCCN: </label>94045581 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Algorithms.
<br/><br/><label>Dewey Class. No.: </label>511.8,BRA