https://wiki.ta.in.th/index.php?action=history&feed=atom&title=%E0%B8%AA%E0%B8%AD%E0%B8%A7%E0%B8%99_%E0%B8%84%E0%B9%88%E0%B8%B2%E0%B8%A2_2_%E0%B8%9B%E0%B8%B5_2555 2026-05-02T18:50:20Z Revision history for this page on the wiki MediaWiki 1.33.0-alpha https://wiki.ta.in.th/index.php?title=%E0%B8%AA%E0%B8%AD%E0%B8%A7%E0%B8%99_%E0%B8%84%E0%B9%88%E0%B8%B2%E0%B8%A2_2_%E0%B8%9B%E0%B8%B5_2555&diff=55&oldid=prev 2019-03-07T17:02:11Z

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

Tata