Easy Learning Data Structures & Algorithms C: Graphic Data Structures & Algorithms

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)

買這商品的人也買了...

商品描述

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 有向圖拓撲排序