作品原文
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.
翻譯
提供介紹數據結構和算法,開放數據結構包括數據結構的實現和分析序列(列表)、佇列、優先權佇列、無序的字典、有序的字典,和圖表。專注於一個嚴格的數學方法,是快速、實用、有效,莫林明顯和迅速呈現指令以及原始碼。
分析和實現在Java中,書中給出的數據結構包括棧、佇列、雙端佇列,和列表作為數組和鍊表,實現空間的實現列表;跳過列表;哈希表,哈希碼;二進制搜尋樹包括treaps替罪羊樹,紅黑樹;整數搜尋結構包括二進制試,x-fast努力,和y-fast嘗試;堆,包括隱式二進制堆和隨機熱熔堆;和圖表,包括鄰接矩陣和鄰接表表示法;b樹。
計算機科學現代治療的一個重要主題,開放數據結構是一個測量平衡經典主題和先進的結構,將所有本科生或自主學習者的需要。帕特莫林副教授在卡爾頓大學計算機科學學院的創始人兼總編輯以及計算幾何的開放獲取期刊。他是眾多會議論文的作者和期刊出版物在計算幾何的主題,算法和數據結構。
