Data Structures and Algorithm Analysis in C, Second Edition
Mark Allen Weiss
This book describes data structures, methods of organizing large amounts of data, and algorithm analysis, theestimation of the running time of algorithms. As computers become faster and faster, the need for programs that canhandle large amounts of input becomes more acute. Paradoxically, this requires more careful attention to efficiency,since inefficiencies in programs become most obvious when input sizes are large. By analyzing an algorithm before itis actually coded, students can 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 for large amounts of data from16 years to less than a second. Therefore, no algorithm or data structure is presented without an explanation of itsrunning time. In some cases, minute details that affect the running time of the implementation are explored.
Año:
2010
Idioma:
english
Páginas:
422
Serie:
2 Edition
Archivo:
PDF, 6.41 MB
IPFS:
,
english, 2010