- 1.
- Alfred V Aho, John E. Hopcroft, and Jeffrey D Ullman.
*Data Structures and Algorithms*. Addison-Wesley, 1983. - 2.
- 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. - 3.
- Donald E Knuth.
*Fundamental Algorithms*, Volume 1 of The Art of Computer Programming, Addison-Wesley, 1968, Second Edition, 1973. - 4.
- Robert L. Kruse, Bruce P. Leung, and Clovis L. Tondo.
*Data Structures and Program design in C*. Prentice Hall, 1991. Indian Edition published by Prentice Hall of India, 1999. - 5.
- Mark Allen Weiss.
*Data Structures and Algorithm Analysis in C++*. Benjamin-Cummings, 1994. Indian Edition published in 1998. - 6.
- Ellis Horowitz, Sartaz Sahni, and Rajasekaran.
*Fundamentals of Computer Algorithms*. W.H. Freeman and Company, 1998. Indian Edition published by Galgotia Publications, 2000. - 7.
- Donald E. Knuth.
*Sorting and Searching*, Volume 3 of The Art of Computer Programming, Addison-Wesley, 1973. - 8.
- Donald E Knuth.
*Seminumerical Algorithms*. Volume 2 of The Art of Computer Programming, Addison-Wesley, 1969, Second Edition, 1981. - 9.
- 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. - 10.
- Kurt Mehlhorn.
*Sorting and Searching*. Volume 1 of*Data Structures and Algorithms*. Springer-Verlag, 1984. - 11.
- William Pugh. Skip Lists: A probabilistic alternative to
balanced trees.
*Communications of the ACM*, Volume 33, Number 6, pp. 668-676, 1990.