Learn the basics of data structures and methods to design algorithms and analyze their performance.
播放:169次,课程ID:3995171
Learn the basics of data structures and methods to design algorithms and analyze their performance.
--A.introduction
--B1.BST : search
--B2.BST : insertion
--B3.BST : removal
--C.balance+equivalence
--D1.AVL : rebalance
--D2.AVL : insertion
--D3.AVL : removal
--D4.AVL : (3+4)-construction
--Homework
--A1.Splay_Tree.splay1
--A2.Splay_Tree.splay2
--A3.Splay_Tree.implementation
--B1.B-Tree.motivation
--B2.B-Tree.structure
--B3.B-Tree.search
--B4.B-Tree.insertion
--B5.B-Tree.removal
--XA1.Red-Black.motivation
--XA2.Red-Black.structure
--XA3.Red-Black.insertion
--XA4.Red-Black.removal
--Homework
--B.hashing.principle
--C.Hashing.Hash-Function
--D1.Hashing.Solving-Collision-1
--D2.Hashing.Solving-Collision-2
--E.Bucketsort
--Homework
--A1.motivation
--A2.Basic_Implementations
--B1.Complete_Binary_Heap.structure
--B2.Complete_Binary_Heap.insertion
--B3.Complete_Binary_Heap.removal
--B4.Complete_Binary_Heap.heapification
--C.Heapsort
--XA1.Leftist_Heap.structure
--XA2.Leftist_Heap.merge
--XA3.Leftist_Heap.insertion+removal
--Homework
--A.ADT
--B1.Pm
--B2.brute-force
--C1.Kmp.memorization
--C2.Kmp.lookup-table
--C3.Kmp.understanding_next[]
--C4.Kmp.constructing_next[]
--C5.Kmp.amortization
--C6.Kmp.improvement
--D1.BM_BC.begin_with_the_end
--D2.BM_BC.bad_character
--D3.BM_BC.constructing_bc[]
--D4.Bm_BC.performance
--E1.Bm_GS.good-suffix
--E2.Bm_GS.constructing_gs[]
--E3.Bm_GS.performance
--F1.KR.fingerprint
--F2.KR.hashing
--Homework
--A1.Quicksort.algorithm
--A2.Quicksort.performance
--A4.Quicksort.Variation
--B1.Selection.mode
--B2.Selection.Median
--C1.Shellsort.Shell's sequence
--C2.Shellsort.Inversion
--Homework
邓俊辉,清华大学计算机系教授。1993和1997年分别于清华大学计算机系获学士、博士学位,1997年起在清华大学任教,他在讲授“数据结构”和“计算几何”方面拥有20多年的经验。