Mark Allen Weiss is Professor and Associate Director for the School of Computing and Information Sciences at Florida International University. He is also currently serving as both Director of Undergraduate Studies and Director of Graduate Studies. He received his Bachelor’s Degree in Electrical Engineering from the Cooper Union in 1983, and his Ph.D. in Computer Science from Princeton University in 1987, working under Bob Sedgewick. He has been at FIU since 1987 and was promoted to Professor in 1996. His interests include data structures, algorithms, and education. He is most well-known for his highly-acclaimed Data Structures textbooks, which have been used for a generation by roughly a million students.
Professor Weiss is the author of numerous publications in top-rated journals and was recipient of the University’s Excellence in Research Award in 1994. In 1996 at FIU he was the first in the world to teach Data Structures using the Java programming language, which is now the de facto standard. From 1997-2004 he served as a member of the Advanced Placement Computer Science Development Committee, chairing the committee from 2000-2004. The committee designed the curriculum and wrote the AP exams that were taken by 20,000 high school students annually.
In addition to his Research Award in 1994, Professor Weiss is also the recipient of the University’s Excellence in Teaching Award in 1999 and the School of Computing and Information Science Excellence in Teaching Award (2005) and Excellence in Service Award (2007).
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.
开篇第一章引论的第一节提出一个问题: “设有一组N个数而要确定其中第K个最大者” 并给出两种解法 全排序后返回K位置上的元素。平均复杂度O(NLogN) 再建立一个临时数组,从N中读取K个数,全排序,然后依次读入其余N - K个数进来和第K名比较,大于K的值则插入到合适位置...
评分薄薄的小书,tex排版,圆圆的字体排代码,c语言代码并不是全的,是c伪代码。 - - 我很菜的,所以专业的东西说不出来。感觉在解说上没有算法导论那样详细(其实我觉得算法导论啰嗦)。
评分 评分这段时间又继续深入的学习了下,觉得主要收获有两个: 收获一:真正的理解了折半查找和插入查找,以前买过一本105元的书,可看了很久,就是不知道作者讲的什么,但是这本书不同,这本书的作者用形象的文字和图片的说明让人的理解入木三分。我自已也动手写了一个demo的查找:查...
好读,对数据结构的介绍比算法导论详细,有implementation
评分入门绝佳教材,把各种数据结构很清晰的用图示和步骤呈现出来,至少从概念来说,讲明白了
评分是一本好书,但是自己只是粗略的看了一遍,也尝试实现了里面的就给常见的算法。课后习题大部分都没有做,难度比较大,后面要花时间做一些课后题。如名字所示,里面有很多对算法进行的数学分析。每一章最后的Reference也是不错的资源,也需要花时间看了。所以现在自己其实不算看完一遍这本书,只是翻了一遍,离看完还需要很长时间以及实践。
评分java版本里错误的代码不少
评分教科书
本站所有内容均为互联网搜索引擎提供的公开搜索信息,本站不存储任何数据与内容,任何内容与数据均与本站无关,如有需要请联系相关搜索引擎包括但不限于百度,google,bing,sogou 等
© 2025 book.wenda123.org All Rights Reserved. 图书目录大全 版权所有