9.11 To Probe Further

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.

Alfred V Aho, John E. Hopcroft, and Jeffrey D Ullman. The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974.

6.

Sara Baase and Allen Van Gelder. Computer Algorithms: Introduction to Design and Analysis. Addison-Wesley, Third Edition, 2000. Indian Edition published by Pearson Education Asia, 2000.

7.

Ellis Horowitz, Sartaz Sahni, and Rajasekaran. Fundamentals of Computer Algorithms. W.H. Freeman and Company, 1998. Indian Edition published by Galgotia Publications, 2000.

8.

Donald E Knuth. Fundamental Algorithms, Volume 1 of The Art of Computer Programming, Addison-Wesley, 1968, Second Edition, 1973.

9.

Donald E. Knuth. Sorting and Searching, Volume 3 of The Art of Computer Programming, Addison-Wesley, 1973.

10.

Y. Langsam, M.J. Augenstein, and A.M. Tenenbaum. Data Structures using C and C++. Second Edition, Prentice Hall, 1996. Indian Edition published by Prentice Hall of India, 2000.

11.

Kurt Mehlhorn. Sorting and Searching. Volume 1 of Data Structures and Algorithms. Springer-Verlag, 1984.

12.

Nicklaus Wirth. Data Structures + Algorithms = Programs. Prentice-Hall, Englewood Cliffs. 1975.

13.

Manuel Blum, Robert W. Floyd, Vaughan Pratt, Ronald L Rivest, and Robert E. Tarjan. Time bounds for selection. Journal of Computer and System Sciences, Volume 7, Number 4, pp.448-461, 1973.

14.

Robert W. Floyd. Algorithm 245 (TreeSort). Communications of the ACM, Volume 7, pp.701, 1964.

15.

C.A.R. Hoare. Algorithm 63 (Partition) and Algorithm 65 (find). Communications of the ACM, Volume 4, Number 7, pp 321-322, 1961.

16.

C.A.R. Hoare. Quicksort. The Computer Journal, Volume 5, Number 1, pp.10-15, 1962.

17.

Robert Sedgewick. Implementing quicksort programs. Communications of the ACM, Volume 21, Number 10, pp.847-857, 1978.

18.

Shell. A High-speed Sorting Procedure. Communications of the ACM, Volume 2, Number 7, pp. 30-32,1959.