Open Data Structures 在线电子书 图书标签: 算法 数据结构 编程 C++ 计算机科学 计算机技术 数据结构,算法,编程,计算机技术,计算机科学 structure
发表于2024-11-14
Open Data Structures 在线电子书 pdf 下载 txt下载 epub 下载 mobi 下载 2024
很不錯的一本open source data structure textbook 與時俱進和安排合理 應該是本書最大特點
评分很不錯的一本open source data structure textbook 與時俱進和安排合理 應該是本書最大特點
评分很不錯的一本open source data structure textbook 與時俱進和安排合理 應該是本書最大特點
评分很不錯的一本open source data structure textbook 與時俱進和安排合理 應該是本書最大特點
评分很不錯的一本open source data structure textbook 與時俱進和安排合理 應該是本書最大特點
Pat Morin is a professor in the School of Computer Science at Carleton University as well as a founder and a managing editor of the open access Journal of Computational Geometry. He is the author of numerous conference papers and journal publications on the topics of computational geometry, algorithms, and data structures.
Offered as an introduction to the field of data structures and algorithms, Open Data Structures covers the implementation and analysis of data structures for sequences (lists), queues, priority queues, unordered dictionaries, ordered dictionaries, and graphs. Focusing on a mathematically rigorous approach that is fast, practical, and efficient, Morin clearly and briskly presents instruction along with source code.
Analyzed and implemented in Java, the data structures presented in the book include stacks, queues, deques, and lists implemented as arrays and linked-lists; space-efficient implementations of lists; skip lists; hash tables and hash codes; binary search trees including treaps, scapegoat trees, and red-black trees; integer searching structures including binary tries, x-fast tries, and y-fast tries; heaps, including implicit binary heaps and randomized meldable heaps; and graphs, including adjacency matrix and adjacency list representations; and B-trees.
A modern treatment of an essential computer science topic, Open Data Structures is a measured balance between classical topics and state-of-the art structures that will serve the needs of all undergraduate students or self-directed learners.Pat Morin is an associate professor in the School of Computer Science at Carleton University as well as founder and managing editor of the open access Journal of Computational Geometry. He is the author of numerous conference papers and journal publications on the topics of computational geometry, algorithms, and data structures.
這書作為undergrad data structure的textbook真的是一個不錯的選擇 從最基礎的array stack linked-list queue binary-tree 到进阶的heap BST random-BST hash 再到一些高级的ds skiplist scapegoat RB-tree trie XYFastTrie B-tree 相比于一些傳統的ds textbook 其中不乏一些s...
评分這書作為undergrad data structure的textbook真的是一個不錯的選擇 從最基礎的array stack linked-list queue binary-tree 到进阶的heap BST random-BST hash 再到一些高级的ds skiplist scapegoat RB-tree trie XYFastTrie B-tree 相比于一些傳統的ds textbook 其中不乏一些s...
评分這書作為undergrad data structure的textbook真的是一個不錯的選擇 從最基礎的array stack linked-list queue binary-tree 到进阶的heap BST random-BST hash 再到一些高级的ds skiplist scapegoat RB-tree trie XYFastTrie B-tree 相比于一些傳統的ds textbook 其中不乏一些s...
评分這書作為undergrad data structure的textbook真的是一個不錯的選擇 從最基礎的array stack linked-list queue binary-tree 到进阶的heap BST random-BST hash 再到一些高级的ds skiplist scapegoat RB-tree trie XYFastTrie B-tree 相比于一些傳統的ds textbook 其中不乏一些s...
评分這書作為undergrad data structure的textbook真的是一個不錯的選擇 從最基礎的array stack linked-list queue binary-tree 到进阶的heap BST random-BST hash 再到一些高级的ds skiplist scapegoat RB-tree trie XYFastTrie B-tree 相比于一些傳統的ds textbook 其中不乏一些s...
Open Data Structures 在线电子书 pdf 下载 txt下载 epub 下载 mobi 下载 2024