Algorithms and data structures lie at the heart of computer science, and are essential tools for every practising programmer. This book provides an indepth treatment of the central algorithms and data structures of computer science, together with an introduction to the techniques of design, correctness and analysis required for understanding them. Beginning with coverage of techniques followed by the major application areas of lists, trees, symbol tables, priority queues, sorting, disjoint sets, and graph algorithms. The theory is then completed with a closing chapter on lower bounds.
Jeffrey H. Kingston is a senior lecturer in the Basser Department of Computer Science at the University of Sydney, Australia. He has published correctness proofs and analyses of a variety of data structures ans algorithms; his other research interests include document formatting, computerized timetable construction and computer science curriculum design.
0201403749AB04062001