Foundations of algorithms - Neapolitan, Richard E.; Naimipour, Kumarss; Neapolitan, Richard E. (Sudbury, Mass. : Jones and Bartlett Publishers, 2011)
Algorithms: efficiency, analysis, and order (Page-1), Divide-and-conquer (Page-47), Dynamic programming (Page-91), The greedy approach (Page-145), Backtracking (Page-197), Branch-and-bound (Page-243), Introduction to computational complexity : the sorting problem (Page-277), More computational complexity : the searching problem (Page-329), Computational complexity and intractability : an introduction to the theory of NP (Page-385), Number-theoretic algorithms (Page-429), Introduction to parallel algorithms (Page-495), .
Keywords: Algorithms; Constructive mathematics; Computational complexity