Fundamentals of Data Structures in C++, 2/e (Paperback)
暫譯: C++ 資料結構基礎 (第二版)
Ellis Horowitz, Sartaj Sahni, Dinesh Mehta
- 出版商: Silicon Press
- 出版日期: 2006-06-30
- 定價: $1,390
- 售價: 9.8 折 $1,362
- 語言: 英文
- 頁數: 694
- 裝訂: Paperback
- ISBN: 0929306376
- ISBN-13: 9780929306377
-
相關分類:
C++ 程式語言、Algorithms-data-structures
-
相關翻譯:
基礎資料結構 ─ 使用 C++ (Fundamentals of Data Structures in C++, 2/e) (繁中版)
銷售排行:
🥈 2024/9 英文書 銷售排行 第 2 名
🥇 2022 年度 英文書 銷售排行 第 1 名
🥇 2022/9 英文書 銷售排行 第 1 名
🥈 2021 年度 英文書 銷售排行 第 2 名
🥈 2021/10 英文書 銷售排行 第 2 名
🥇 2021/8 英文書 銷售排行 第 1 名
立即出貨
買這商品的人也買了...
-
$970Introduction to Algorithms, 2/e
-
$230$152 -
$1,176Computer Organization and Design: The Hardware/Software Interface, 3/e(IE) (美國版ISBN:1558606041)
-
$880$695 -
$880$695 -
$550$468 -
$980$774 -
$790$774 -
$880$695 -
$990$891 -
$600$480 -
$1,362Fundamentals of Data Structures in C, 2/e (Paperback)
-
$620$490 -
$1,558Introduction to Algorithms, 3/e (IE-Paperback)
-
$1,200$1,176 -
$1,715Introduction to Algorithms, 3/e (Hardcover)
-
$780$616 -
$940$700 -
$1,646Operating System Concepts, 9/e (IE-Paperback)
-
$1,617Computer Organization and Design: The Hardware/Software Interface, 5/e (Asian Edition)(IE-Paperback)
-
$1,380$1,352 -
$1,350$1,283 -
$990$782 -
$1,750$1,663 -
$2,146Introduction to Algorithms, 4/e (Hardcover)
相關主題
商品描述
Description
This new edition provides a comprehensive and technically rigorous introduction to data structures such as arrays, stacks, queues, linked lists, trees and graphs and techniques such as sorting hashing that form the basis of all software. In addition, this text presents advanced or specialized data structures such as priority queues, efficient binary search trees, multiway search trees and digital search structures.
The book has been updated to include the latest features of the C++ language. Features such as exceptions and templates are now incorporated throughout the text along with limited exposure to STL. Treatment of queues, iterators and dynamic hashing has been improved. The book now discusses topics such as secure hashing algorithms, weightbiased leftist trees, pairing heaps, symmetric minmax heaps, interval heaps, topdown splay trees, B+ trees and suffix trees. Redblack trees have been made more accessible. The section on multiway tries has been significantly expanded and discusses several trie variations and their application to Internet packet forwarding.
Table of Contents
- Chapter 1. Basic Concepts
- Chapter 2. Arrays
- Chapter 3. Stacks and Queues
- Chapter 4. Linked Lists
- Chapter 5. Trees
- Chapter 6. Graphs
- Chapter 7. Sorting
- Chapter 8. Hashing
- Chapter 9. Priority Queues
- Chapter 10. Efficient Binary Search Trees
- Chapter 11. Multiway Search Trees
- Chapter 12. Digital Search Structures
商品描述(中文翻譯)
**描述**
這本新版本提供了對資料結構的全面且技術嚴謹的介紹,包括陣列、堆疊、佇列、鏈結串列、樹和圖,以及排序、雜湊等技術,這些都是所有軟體的基礎。此外,本書還介紹了進階或專門的資料結構,如優先佇列、高效的二元搜尋樹、多路搜尋樹和數位搜尋結構。
本書已更新以包含 C++ 語言的最新特性。例外處理和模板等特性現在已貫穿整本書,並有限地介紹 STL。對於佇列、迭代器和動態雜湊的處理有所改善。書中現在討論的主題包括安全雜湊演算法、權重偏向的左式樹、配對堆、對稱最小最大堆、區間堆、自上而下的伸展樹、B+ 樹和後綴樹。紅黑樹的可接觸性已提高。多路字典樹的部分已大幅擴展,並討論了幾種字典樹變體及其在網際網路封包轉發中的應用。
**目錄**
1. 基本概念
2. 陣列
3. 堆疊與佇列
4. 鏈結串列
5. 樹
6. 圖
7. 排序
8. 雜湊
9. 優先佇列
10. 高效的二元搜尋樹
11. 多路搜尋樹
12. 數位搜尋結構