演算法 | 實踐大學影音平台

1.
Algorithms
- 14:55
  
  1.1 Algorithm_ch1
2.
Time Complexity
- 22:03
  
  2.1 Algorithm_ch2
3.
Insertion Sort
- 20:06
  
  3.1 Straight Insertion Sort
- 18:53
  
  3.2 Insertion Table
- 12:10
  
  3.3 The average Case of Insertion
4.
Selection
- 26:26
  
  4.1 Algorithm_selection_1
- 19:50
  
  4.2 Algorithm_selection_2
5.
Binary Search
- 13:24
  
  5.1 Binary Search
- 07:30
  
  5.2 Binary Search 2
- 11:16
  
  5.3 Binary Search 3
6.
Spanningtree
- 16:49
  
  6.1 Algorithm_spanningtree
7.
Prim
- 11:36
  
  7.1 Algorithm_prim
8.
2 Way Merge
- 15:17
  
  8.1 Algorithm_2waymerge
9.
Huffman
- 10:08
  
  9.1 Algorithm_huffman
10.
Divide and conquer
- 10:18
  
  10.1 Algorithm_divideandconquer
11.
2D max finding
- 11:32
  
  11.1 Algorithm_2dmaxfinding
12.
Closest pair
- 10:16
  
  12.1 Algorithm_closestpair
13.
Tree Searching
- 09:44
  
  13.1 Algorithm_TreeSearching
- 20:28
  
  13.2 Algorithm_TreeSearching_2
14.
Branch and Bound
- 08:28
  
  14.1 Algorithm_BranchandBound
15.
Personnel Assignment
- 15:44
  
  15.1 Algorithm_PersonnelAssignment
16.
Traveling Salesperson
- 13:59
  
  16.1 Algorithm_TravelingSalesperson
- 10:54
  
  16.2 Algorithm_QuickSort_1
- 15:32
  
  16.3 Algorithm_QuickSort_2Pivot