สอวน ค่าย 2 ปี 2555
Jump to navigation
Jump to search
Intro To Camp2
- Complexity
Stack
- Push
- Pop
- Infix/Postfix/Prefix
- โจทย์
- วงเล็บ (paren)
- [A3C#10] สวนสนุกสุดหรรษาหลั่นล๊าฮาเฮ (themepark)
Queue
- Enqueue
- Dequeue
- Circular Queue
Recursion
- Fibonacci
- Combination
- Permutation
- Flood Fill
Search
- Depth-First-Search
- Graph มี Cycle ไม๊ ??
- Bipartite Graph
- Knight (ม้า) เดินไปตำแหน่งใดได้บ้างใน map
- Breadth-First-Search
- โจทย์
- Bipartite Graph (bipartite)
Backtracking
- Lower-Upper Bound
- N-Queen Problem
- Assignment Problem
Linked List
- Pointer
- Singly Linked List
- Doubly Linked List
- Multiply Linked List
- Circular List
Trees
- Binary Search Tree
- Heap
- Traversal
- Preorder
- Inorder
- Postorder
Hashing
- Open Addressing
- Linear Probing
- Quadratic Probing
- Separate Chaining
Greedy Algorithm
- Knapsack
- Huffman Coding
Divide and Conquer
- Binary Search
- Tilling
Sorting
- Insertion Sort
- Selection Sort
- Bubble Sort
- Rapid Sort
- Counting Sort
- Radix Sort
- Bucket Sort
- Topological Sort
- Merge Sort
- Quick Sort
- Heap Sort
Decrease and Conquer
- Quick Select
- Euclid
- Tower Of Hanoi
Transform and Conquer
- Instance Simplification (Such Sort)
- Representation Change (Such Change Input)
- Problem Reduction (Change Problem)
Representation Of Graph
- Minimum Spanning Tree
- Prim
- Kruskal
- Shortest Path
- Djkstra
- Floyd Warshall
String Matching
- Horspool's
- Boyer-Moore
Dynamic Programming
- 0/1 Knapsack
- Coin Change
- Longest Common Subsequence
- Longest Common Substring
- Longest Increasing Subsequence
Bignum, Random, qsort, File, STL, Etc.