EC504_Advanced_Algorithms_and_Data_Structures 回顾基本数据结构和C ++语法。 在高级语言和数据库环境中的数据抽象和面向对象的设计。 从数据结构效率和分布式控制的角度进行设计实现。 针对实际问题（例如网络路由，数据库管理和事务处理）调整优先级队列，平衡的搜索树和图形算法。

高级数据结构--详细描述tree，search

Algovault 这是用于竞争性编程的算法，数据结构和模板的集合。 简而言之，这些是该项目的目标： 在诸如 ， 等在线竞赛中有用。 在不影响速度的情况下，用作黑匣子应该相对简单。 用法示例和足够的文档。 大多数代码都是用C / C ++编写的，有些则是用Python编写的。 尽管大多数实现在几位在线法官中经过了压力测试并针对各种问题进行了交叉检查，但仍不能保证它们无缺陷且在所有情况下均有效。 对于错误，重构和改进，随时欢迎提交问题或提出请求。 动机 最初的目标是仅在线上传我的个人模板，仅此而已:) 不久，我偶然发现了一个名为项目。 KACTL是公开的KTH皇家技术学院的ICPC团队参考文件。 这是很棒的，可能是我见过的最好的团队笔记本电脑，但是ICPC对笔记本电脑设置了25页的限制，因此，有很多算法和变体对在线比赛有所帮助，因此必须予以忽略。 然后存在像这样的项目。 尽管这是一个不错的计划，但它并不适合竞争性编程。 同样的算法有太多的实现，这些实现令人困惑且非常具体。 还有其他一些很棒的库，例如 ， ， ， ， 创建的，但是它们确实存在一些共同的问题。 有些只专

FMI-DSA：一些示例由我（Ivan Filipov）作为索菲亚大学数学与信息科学学院的助教提供（Ivan Filipov）2016-2019

supdate：具有超能力的Clojure更新

全名: data structures and problem solving using java

本书是对熟悉编程和基本数学语言的学生和专业人员的简要介绍。 这些算法以现代方式呈现，带有明确表述的不变式，并对最新趋势进行了评论。

《Data Structures and Algorithm Analysis in Java, Third Edition》 Mark Allen Weiss 英文版

The fourth edition of Data Structures and Algorithm Analysis in C++ describes data structures, methods of organizing large amounts of data, and algorithm 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. Once a solution method is determined, a program must still be written. As computers have become more powerful, the problems they must solve have become larger and more complex, requiring development of more intricate programs. The goal of this text is to teach students good programming and algorithm analysis skills simultaneously so that they can develop such programs with the maximum amount of efficiency. This book is suitable for either an advanced data structures course or a first-year graduate course in algorithm analysis. Students should have some knowledge of intermediate programming, including such topics as pointers, recursion, and object-based programming, as well as some background in discrete math.

Data Structures With C++ Using STL(中文版).pdf 数据结构C++描述应用STL