Easy Learning Data Structures & Algorithms C: Graphic Data Structures & Algorithms
暫譯: 輕鬆學習資料結構與演算法 C:圖形資料結構與演算法
Hu, Yang
- 出版商: Independently Published
- 出版日期: 2019-07-30
- 售價: $1,600
- 貴賓價: 9.5 折 $1,520
- 語言: 英文
- 頁數: 240
- 裝訂: Quality Paper - also called trade paper
- ISBN: 1086368088
- ISBN-13: 9781086368086
-
相關分類:
Algorithms-data-structures
立即出貨 (庫存=1)
買這商品的人也買了...
-
$2,980$2,831 -
$990$782
商品描述
This book Made Easy to learn Data Structures and Algorithms. There are multiple solutions for each problem and the book is coded in C, it comes handy as an interview and exam guide for computer scientists.All data structures are illustrated with simple examples and diagrams. Every important feature of the language is illustrated in depth by a complete programming example. Wherever necessary, picture descriptions of concepts are included to facilitate better understanding.1. Linear Table Definition2. Linear Table Append3. Linear Table Insert4. Linear Table Delete5. Linear Table Search6. Bubble Sorting Algorithm7. Select Sorting Algorithm8. Insert Sorting Algorithm9. Dichotomy Binary Search10. Unidirectional Linked List10.1 Create and Initialization10.2 Add Node10.3 Insert Node10.4 Delete Node11. Doubly Linked List11.1 Create and Initialization11.2 Add Node11.3 Insert Node11.4 Delete Node12. One-way Circular LinkedList12.1 Initialization and Traversal12.2 Insert Node12.3 Delete Node13. Two-way Circular LinkedList13.1 Initialization and Traversal13.2 Insert Node13.3 Delete Node14. Queue15. Stack16. Recursive Algorithm17. Two-way Merge Algorithm18. Quick Sort Algorithm19. Binary Search Tree 19.1 Construct a binary search tree 19.2 Binary search tree In-order traversal 19.3 Binary search tree Pre-order traversal 19.4 Binary search tree Post-order traversal 19.5 Binary search tree Maximum and minimum 19.6 Binary search tree Delete Node20. Binary Heap Sorting21. Hash Table22. Graph 22.1 Undirected Graph and Depth-Frst Search 22.2 Undirected Graph and Breadth-First Search 22.3 Directed Graph and Depth-Frst Search 22.4 Directed Graph and Breadth-First Search 22.5 Directed Graph Topological Sorting
商品描述(中文翻譯)
這本書使學習資料結構和演算法變得簡單。每個問題都有多種解決方案,並且本書使用 C 語言編寫,作為計算機科學家的面試和考試指南非常方便。所有資料結構都用簡單的範例和圖示進行說明。語言的每個重要特性都通過完整的程式範例深入說明。在必要的地方,還包含了概念的圖片描述,以促進更好的理解。
1. 線性表定義
2. 線性表附加
3. 線性表插入
4. 線性表刪除
5. 線性表搜尋
6. 冒泡排序演算法
7. 選擇排序演算法
8. 插入排序演算法
9. 二分搜尋法
10. 單向鏈結串列
10.1 創建與初始化
10.2 添加節點
10.3 插入節點
10.4 刪除節點
11. 雙向鏈結串列
11.1 創建與初始化
11.2 添加節點
11.3 插入節點
11.4 刪除節點
12. 單向循環鏈結串列
12.1 初始化與遍歷
12.2 插入節點
12.3 刪除節點
13. 雙向循環鏈結串列
13.1 初始化與遍歷
13.2 插入節點
13.3 刪除節點
14. 隊列
15. 堆疊
16. 遞迴演算法
17. 雙向合併演算法
18. 快速排序演算法
19. 二元搜尋樹
19.1 構建二元搜尋樹
19.2 二元搜尋樹的中序遍歷
19.3 二元搜尋樹的前序遍歷
19.4 二元搜尋樹的後序遍歷
19.5 二元搜尋樹的最大值與最小值
19.6 二元搜尋樹刪除節點
20. 二元堆排序
21. 雜湊表
22. 圖
22.1 無向圖與深度優先搜尋
22.2 無向圖與廣度優先搜尋
22.3 有向圖與深度優先搜尋
22.4 有向圖與廣度優先搜尋
22.5 有向圖拓撲排序