文件名称：Data Structures and Algorithm Analysis in C++ Fourth Edition
文件大小：4.21MB
文件格式：PDF
更新时间：2017-01-28 15:51:23
数据结构
C++实现数据结构最新版The fourth edition ofData Structures and Algorithm Analysis in C++describesdata structures, methods of organizing large amounts of data, andalgorithm analysis,the estimation of the running time of algorithms. As computers become faster and faster, the need for programs that can handle 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 it is actually coded, students can decide if a particular solution will be feasible. For example, in this text students look at specific problems and see how careful implementations can reduce the time constraint for large amounts of data from centuries to less than a second. Therefore, no algorithm or data structure is presented without an explanation of its running time. In some cases, minute details that affect the running time of the implementation are explored.