Algorithms

3

# Techniques for analysis of algorithms.
# Methods for design of efficient algorithms: Divide and concur, greedy method.
#Dynamics programming.
#Back tracing.
# Branch and bound.
#Basic search and traversal techniques.
# Graph algorithms.
# Algebraic simplification and transformations.
#Lower bound theory.
# NP-hard and NP-complete problems.

Fundamentals of Computer Algorithms by Ellis Horowitz & Sartaj Sahni
Algorithms by Robert Sedgwick
The Art of Computer Programming, Vol. I, Fundamental Algorithms by D. E. Knuth
The Art of Computer Programming, Vol. II, Seminumerical Algorithms by D. E. Knuth
The Art of Computer Programming, Vol. III , Sorting and Searching by D. E. Knuth
How to solve it by Computer? by R. G. Drommey
Introduction to the Design and Analysis of Algorithms by Goodman