Table of Contents

  1. 課程簡介
    Java 簡介
    Java Primer
  2. Classes and Objects
    程式例題
  3. Class Relationships
    程式例題
  4. Designing Classes
    程式例題
  5. Introduction to Algorithms
    簡單的排序法
    漸近線表示法
    程式例題
    示範:
    1. Selection Sort
    2. Insertion Sort
    3. Insertion Sort 2
    4. Two Way Selection Sort
    5. Bubble Sort
    6. Bubble Sort 2
  6. Generic Classes and Methods
    程式例題
  7. Collections and Lists
    程式例題
  8. The Array-Based List Collection(陣列表示法)
    程式例題
    示範:ArrayLinearList
  9. Linked Lists(鏈結表示法)
    程式例題
    示範:
    1. Linked List Operations
    2. Chain
    3. Double Linked List
  10. Iterators 疊代器
    程式例題
  11. Stacks 堆疊
    程式例題
    示範:
    1. AbstractStack
    2. ArrayStack
    3. LinkedStack
    4. Linked Stack 2
    5. Postfix Expression Evaluation
    6. Postfix Enumeration
    應用示範:
    1. Rat In AMaze
    2. Towers Of Hanoi
    3. Railroad With Stacks
  12. Queues and Priority Queues 佇列
    程式例題
    示範:
    1. ArrayQueue
    2. LinkedQueue
    3. Radix Sort
    4. Priority Queue
    應用示範:
    1. Wire Routing
    2. Image Labeling
  13. Binary Trees 二元樹及其他
    程式例題
    示範:
    1. Tree Traversals
    2. Tree Traversals 2
  14. Binary Search Trees 二元搜尋樹
    程式例題
    示範:
    1. Binary Search Tree Demos
    2. Binary Search Tree
    3. Binary Search Tree 2
  15. Hashing as a Map Implementation 雜湊
    程式例題
    示範:
    1. Hash Table with Linked Lists
    2. Hash Table
    3. Exponential Hashing
  16. Heaps堆積
    程式例題
    示範:
    1. Heap sort
    2. Heap sort 2
  17. Graphs and Paths
    程式例題
    示範:
    1. AbstractGraph
    2. Graph Representation
    3. Depth First Search
    4. Dijkstra's minum-path algorithm
    5. Minimum spanning tree
    6. MST demos:
  18. Balanced Search Trees
    程式例題
    示範:
    1. AVL Tree
    2. 2-3-4 Tree
    3. Red-Black Tree
    4. BST, AVL, BT, Red-Black, AA Trees
    5. BST, AVL, BT, Red-Black, AA, SkipList, Heap, Treap, Scapegoat, Splay Trees
[Home]