Data Structures & Algorithm Analysis in C++

Description

methods of organizing large amounts of data, and algorithm analysis, the estimation of therunning time of algorithms. As computers become faster and faster, the need for programsthat can handle large amounts of input becomes more acute. Paradoxically, this requiresmore careful attention to efficiency, since inefficiencies in programs become most obviouswhen input sizes are large. By analyzing an algorithm before it is actually coded, studentscan decide if a particular solution will be feasible. For example, in this text students look atspecific problems and see how careful implementations can reduce the time constraint forlarge amounts of data from centuries to less than a second. Therefore, no algorithm or datastructure is presented without an explanation of its running time. In some cases, minutedetails that affect the running time of the implementation are explored.Once a solution method is determined, a program must still be written. As computershave become more powerful, the problems they must solve have become larger and morecomplex, requiring development of more intricate programs. The goal of this text is to teachstudents good programming and algorithm analysis skills simultaneously so that they candevelop such programs with the maximum amount of efficiency.This book is suitable for either an advanced data structures course or a first-yeargraduate course in algorithm analysis. Students should have some knowledge of intermediateprogramming, including such topics as pointers, recursion, and object-basedprogramming, as well as some background in discrete math.