배운순서대로


1. Big Oh notation, Merge sort


2, Priority Queues, heapify, Heap sort, Binomial Heap


3. Quick select, Quick sort, Bucket sort, Radixsort


4. Dictionary, AVL Tree, Treap, Scapegoat Tree


5. Skip Lists, Move-To-Front heuristic


6. Interpolation Search, Trie, Compressed Trie, Multiway Trie


7. Hashing, Collision, Separate Chaining, Linear Probing, Double Hashing, Cuckoo Hashing


8. Range Search, Range Query, Quad tree, kd-tree, Range tree, Range query in Treaps, Priority Search Tree


9. String Matching, Karp-Rabin Fingerprint Algorithm, Boyer-Moore Algorithm, Bad character heuristic, Good suffix heuristic, Knuth-Morris-Pratt Algorithm, Suffix tree, Suffix array.


10. Compression, Huffman Codes, Run-Length Encoding, bzip2, Burrows-Wheeler Transform, Lempel-Ziv-Welch


11. External memory, External sorting, Merge sort, d-way merge sort, Dictionaries in external memory, 2-4 Tree, a-b-Tree, B-Tree, Extendible hashing, Red-Black tree, B+ tree, Cache-oblivious tree


2학년 수업이였지만 참 빡셌어요 ㅠㅠ