原创 平衡樹——2-3樹(Binary Search Tree - 2-3 Tree)
平衡樹——2-3樹(Binary Search Tree - 2-3 Tree) 簡介(Introduction) 2-3 trees and 2-3-4 trees are binary search trees that
2020-06-21 10:44:21
42
原创 貪心算法——普林姆算法(Greedy Algorithm-Prim's Algorithm)
貪心算法——普林姆算法(Greedy Algorithm-Prim’s Algorithm) 貪心算法簡介(Introduction of Greedy Algorithm) (pic: https://www.sicas
2020-06-21 10:44:21
6
原创 排序算法——堆排序(Heap Sort)
排序算法——堆排序(Heap Sort) 堆(Heap) Heap is a complete binary tree which satisfies the heap condition: Each child has a
2020-06-21 03:44:12
原创 時空權衡——斐波那契數列(Time/Space Tradeoff - Fibonacci Sequence)
時空權衡——斐波那契數列(Time/Space Tradeoff - Fibonacci Sequence) 斐波那契數列簡介(Introduction) In mathematics, the Fibonacci numbe
2020-06-21 03:44:12
6
原创 動態規劃算法——沃夏爾算法(Dynamic Programming Algorithm - Warshall's Algorithm)
動態規劃算法——沃夏爾算法(Dynamic Programming Algorithm - Warshall’s Algorithm) 傳遞閉包(Transitive Closure) “The transitive clos
2020-02-21 23:20:28
原创 時空權衡——字符串匹配(Time/Space Tradeoff - Horspool's String Matching)
時空權衡——字符串匹配(Time/Space Tradeoff - Horspool’s String Matching) 字符串匹配簡介(Introduction) String matching is to find a
2020-02-21 23:20:28
原创 動態規劃算法——弗洛伊德算法(Dynamic Programming Algorithm - Floyd's Algorithm)
動態規劃算法——弗洛伊德算法(Dynamic Programming Algorithm - Floyd’s Algorithm) 僞代碼(Pseudocode) function Floyd(W[1..n, 1..n])
2020-02-21 23:20:28
原创 排序算法——冒泡排序(Bubble Sort)
排序算法——冒泡排序(Bubble Sort) 算法簡介(Introduction) Bubble sort is to compare adjacent elements of the list and exchange t
2020-02-21 23:20:28
原创 Transform and Conquer - Instance Simplification
Transform and Conquer - Instance Simplification 原理(Principles) Try to make the problem easier through some pre-pr
2020-02-21 23:20:28
原创 貪心算法——狄克斯特拉算法(Greedy Algorithm - Dijkstra's Algorithm)
貪心算法——狄克斯特拉算法(Greedy Algorithm - Dijkstra’s Algorithm) 最短路徑問題(The Single-Source Shortest Path Problem) In real li
2020-02-21 23:20:28
原创 時空權衡——哈希法(Time/Space Tradeoff - Hashing)
時空權衡——哈希法(Time/Space Tradeoff - Hashing) 哈希法簡介(Introduction) Hashing is a standard way of implementing the abstra
2020-02-21 23:20:27
原创 動態規劃算法——揹包問題(Dynamic Programming Algorithm - Knapsack Problem)
動態規劃算法——揹包問題(Dynamic Programming Algorithm - Knapsack Problem) 揹包問題(Knapsack Problem) (picture is from https://
2020-02-21 23:20:27
原创 平衡樹——自平衡二叉樹(Balanced Tree - AVL Tree)
平衡樹——自平衡二叉樹(Balanced Tree - AVL Tree) 定義(Definition) An AVL tree is a self-balancing binary search tree. It was n
2020-02-21 23:20:17
1
原创 GSON
What is GSON? A Java serialization/deserialization library to convert Java Objects into JSON and back is designed by g
2018-09-04 03:07:49
2
原创 Java - Introduction
Java - Introduction What is Java? Java is well-known as a programming language for Internet applications. Why is th
2018-09-04 03:07:49