Ö¸¶¨ÓÕø
1.Introuction to Algorithms
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein
2.Fundamentals of Data Structures in C£«£«
Ellis Horowitz, Sartaj Sahni, Dinesh Mehta
…¢¿¼ÙYÁÏ
Algorithms in C£«£«; Robert Sedgewick
----------------------¿Î³ÌĿ¼------------------------------
¿Î³Ì´ó¸Ù£º
Week 0
Overview
¿Î³Ì½éÉÜ
Week 1
Getting Started; Heap
SortingµÄ·½·¨&·ÖÎö
SortingµÄ·ÖÎö
Growth of Function
Insertion SortÉÏ»ú
Exercises
Heap-1
Heap-2
Exercises
Week 2
Sorting Lower Bound
Lower Bound on Comparison Sorts- 1
Lower Bound on Comparison Sorts- 2
Exercises
Basic Data Structures I (List, Queue, Stack)
Pointers in C
Basic Data Structure¢ñ- 1
Basic Data Structure¢ñ- 2
JosephusÉÏ»ú
BalancedÀ¨ºÅÉÏ»ú
ListÉÏ»ú_insert
ListÉÏ»ú_delete
Exercises
Week 3
Basic Data Structures II (Tree, Graph)
Tree and Graph
Exercises
Graph and Tree Traversals I (BFS, DFS)
Breadth First Search
Depth First Search
Depth First Search·ÖÎö
Exercises
Week 4
Graph and Tree Traversals II (Tree Traversals, Expression Tree )
Tree Traversal
Expreesion Tree&Postfix Notation of an Expression
Infix-Postfix Coversion
Exercises
Graph and Tree Traversals III (Topological Sort)
Topological Sort
Topological Ö¤Ã÷
Two IQ questions
Exercises
Week 5
Searching Set Data I (Binary Search Tree)
Binary Search Tree
Binary Search Tree ʵ×÷ (Min/Max)
Binary Search Tree ʵ×÷ (Search Predecessor)
Binary Search Tree ʵ×÷ (Insert/Delete)
Binary Search Tree ʵ×÷ (Delete)- Case 1&2
Binary Search Tree ʵ×÷ (Delete)- Case 3
BSTÉÏ»ú_insert
BSTÉÏ»ú_delete_1
BSTÉÏ»ú_delete_2
BSTÉÏ»ú_3
Exercises
Week 6
Searching Set Data II (AVL Tree)
AVL Tree
AVL Tree- Rotation
AVL Tree- InsertionµÄÇéÐÎ
AVL Tree- Insertionʵ×÷Case2.2
AVL Tree- Insertionʵ×÷Case2.3
AVL Tree Insert ²¹³ä& Delete
Augmenting Data Structure
Exercises
Week 7
Searching Set Data III (B-Tree)
B-tree EM Model
B-tree insert
B-tree delete
Exercises
Week 8
Hashing (Chaining, Open Addressing)
Hashing
Common Hash Function
Exercises
Suffix Tree and Suffix Array
Indexing Strings& Suffix Array
Exercises