Brassard, Gilles <br/><br/>
Fundamentals of algorithm 
/ Gilles Brassard, Paul Bratley 
 -  Pearson Education, 
 - xix, 524 p. 
<br/><br/>1.	Preliminaries<br/>2.	Elementary algorithms<br/>3.	Asymptotic notation<br/>4.	Analysis algorithms<br/>5.	Some data structures<br/>6.	Greedy algorithms<br/>7.	Divide and conquer<br/>8.	Dynamic programming<br/> 
<br/><br/><label>ISBN: </label>9788131712443 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Education<br/>Mathematics
<br/><br/><label>Dewey Class. No.: </label>511.8  / B7367