Easy Learning Data Structures & Algorithms Java Practice: Data Structures and Algorithms Guide in Java
暫譯: 輕鬆學習資料結構與演算法 Java 實作:Java 中的資料結構與演算法指南

Hu, Yang

  • 出版商: Independently Published
  • 出版日期: 2019-05-03
  • 售價: $1,840
  • 貴賓價: 9.5$1,748
  • 語言: 英文
  • 頁數: 232
  • 裝訂: Quality Paper - also called trade paper
  • ISBN: 1096719932
  • ISBN-13: 9781096719939
  • 相關分類: Java 程式語言Algorithms-data-structures
  • 海外代購書籍(需單獨結帳)

商品描述

Data Structures and Algorithms Java Practice, It is designed to be easy to read and understand although the topic itself is complicated. Algorithms are the procedures that software programs use to manipulate data structures. Besides clear and simple example programs, The programs demonstrate in graphical form what data structures look like and how they operate. 1. Linear Table Definition2. Linear Table Append3. Linear Table Delete4. Linear Table Search5. Bubble Sorting Algorithm6. Select Sorting Algorithm7. Insert Sorting Algorithm8. Dichotomy Binary Search9. Unidirectional Linked List10. Doubly Linked List11. One-way Circular LinkedList12. Two-way Circular LinkedList13. Queue14. Stack15. Recursive Algorithm16. Two-way Merge Algorithm17. Quick Sort Algorithm18. Binary Search Tree 18.1 Construct a binary search tree 18.2 Binary search tree In-order traversal 18.3 Binary search tree Pre-order traversal 18.4 Binary search tree Post-order traversal 18.5 Binary search tree Maximum and minimum 18.6 Binary search tree Delete Node19. Binary Heap Sorting20. Hash Table21. Graph 21.1 Undirected Graph and Depth-Frst Search 21.2 Undirected Graph and Breadth-First Search 21.3 Directed Graph and Depth-Frst Search 21.4 Directed Graph and Breadth-First Search 21.5 Directed Graph Topological Sorting

商品描述(中文翻譯)

資料結構與演算法 Java 實作,本書旨在使讀者易於閱讀和理解,儘管主題本身相當複雜。演算法是軟體程式用來操作資料結構的程序。除了清晰且簡單的範例程式外,這些程式以圖形方式展示資料結構的外觀及其運作方式。

1. 線性表定義
2. 線性表附加
3. 線性表刪除
4. 線性表搜尋
5. 冒泡排序演算法
6. 選擇排序演算法
7. 插入排序演算法
8. 二分搜尋法
9. 單向鏈結串列
10. 雙向鏈結串列
11. 單向循環鏈結串列
12. 雙向循環鏈結串列
13. 隊列
14. 堆疊
15. 遞迴演算法
16. 雙向合併演算法
17. 快速排序演算法
18. 二元搜尋樹
18.1 建構二元搜尋樹
18.2 二元搜尋樹的中序遍歷
18.3 二元搜尋樹的前序遍歷
18.4 二元搜尋樹的後序遍歷
18.5 二元搜尋樹的最大值與最小值
18.6 二元搜尋樹刪除節點
19. 二元堆排序
20. 雜湊表
21. 圖
21.1 無向圖與深度優先搜尋
21.2 無向圖與廣度優先搜尋
21.3 有向圖與深度優先搜尋
21.4 有向圖與廣度優先搜尋
21.5 有向圖拓撲排序