Data Structures and Algorithm Analysis in Java 图书pdf下载

马克艾伦维斯 是佛罗里达州迈阿密国际大学工程与计算学院计算机科学杰出大学教授和本科教育副院长。他还曾担任通用计算、建筑和工程教育学院 (SUCCEED) 的创始主任，此前曾担任计算和信息科学学院的副主任九年。
他于 1983 年获得 The Cooper Union 的电气工程学士学位，并获得博士学位。 1987 年在普林斯顿大学获得计算机科学博士学位，在 Bob Sedgewick 手下工作。他自 1987 年以来一直在 FIU，并于 1996 年晋升为教授。他的兴趣包括数据结构、算法和教育，他最知名的是他的备受赞誉的独着的数据结构教科书，这些教科书是在计算机科学中应用最为广泛。从 1997 年至 2004 年，他担任大学先修计算机科学发展委员会的成员，并于 2000 年至 2004 年担任委员会主席。 Weiss 博士是 IEEE Fellow、AAAS Fellow 和 ACM 杰出教育家。他是 2015 年 SIGCSE 计算机科学教育杰出贡献奖、2017 年 IEEE 计算机学会 Taylor Booth 教育奖、2018 年 IEEE 教育学会 William Sayle 教育成就奖和 2021 年 ACM Karl V. Karlstrom 杰出教育家奖的获得者.

Data Structures and Algorithm Analysis in Java 本书 pdf 阅读和下载 马克艾伦维斯

Data Structures and Algorithm Analysis in Java is an “advanced algorithms” book that fits between traditional CS2 and Algorithms Analysis courses. In the old ACM Curriculum Guidelines, this course was known as CS7. This text is for readers who want to learn good programming and algorithm analysis skills simultaneously so that they can develop such programs with the maximum amount of efficiency. Readers should have some knowledge of intermediate programming, including topics as object-based programming and recursion, and some background in discrete math.   As the speed and power of computers increases, so does the need for effective programming and algorithm analysis. By approaching these skills in tandem, Mark Allen Weiss teaches readers to develop well-constructed, maximally efficient programs in Java.   Weiss clearly explains topics from binary heaps to sorting to NP-completeness, and dedicates a full chapter to amortized analysis and advanced data structures and their implementation. Figures and examples illustrating successive stages of algorithms contribute to Weiss’ careful, rigorous and in-depth analysis of each type of algorithm. A logical organization of topics and full access to source code complement the text’s coverage.