Next: 1.4 Problems
Up: 1. Introduction
Previous: 1.2.7 An Example:
The following books provide an excellent treatment of the topics
discussed in this chapter. The readers should also study two other
key topics: (1) Recursion; (2) Recurrence Relations, from these sources.
- 1.
- Alfred V Aho, John E. Hopcroft, and Jeffrey D Ullman.
Data Structures and Algorithms. Addison-Wesley, 1983.
- 2.
- Gilles Brassard and Paul Bratley.
Fundamentals of Algorithmics.
Prentice-Hall, 1996. Indian Edition published by Prentice Hall
of India, 1998.
- 3.
- Thomas H. Cormen, Charles E. Leiserson, and Donald L. Rivest.
Introduction to Algorithms. The MIT Electrical Engineering and
Computer Science Series, 1990. Indian Edition published in 1999.
- 4.
- Mark Allen Weiss. Data Structures and Algorithm Analysis in C++.
Benjamin-Cummings, 1994. Indian Edition published in 1998.
- 5.
- R.L. Graham, D.E. Knuth, and O. Patashnik. Concrete Mathematics.
Addison-wesley, Reading, 1990. Indian Edition published by Addison-Wesley
Longman, 1998.
eEL,CSA_Dept,IISc,Bangalore