Open Data Structures pdf epub mobi txt 電子書下載2025

☆☆☆☆☆

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.

出版者:AU Press

作者:Pat Morin

出品人:

頁數:344

译者:

出版時間:2013-6

價格:USD 29.66

裝幀:Paperback

isbn號碼:9781927356388

叢書系列:

圖書標籤:

算法
數據結構
編程
C++
計算機科學
計算機技術
數據結構,算法,編程,計算機技術,計算機科學
structure

下載連結在頁面底部

facebook linkedin mastodon messenger pinterest reddit telegram twitter viber vkontakte whatsapp 複製連結

想要找書就要到圖書目錄大全

book.wenda123.org

立刻按 ctrl+D收藏本頁

你會得到大驚喜!!

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...

評分☆☆☆☆☆