算法导论课程表
需积分: 10 66 浏览量
2015-09-18
16:16:18
上传
评论
收藏 38KB DOC 举报
SE
S #
TOPICS KEY DATES
L1
Administrivia
Introduction
Analysis of Algorithms, Insertion Sort, Mergesort
Problem set 1 out
R1
Correctness of Algorithms
Horner's rule
L2
Asymptotic Notation
Recurrences
Substitution, Master Method
L3
Divide-and-Conquer: Strassen, Fibonacci, Polynomial
Multiplication
R2 Recurrences, Sloppiness
L4 Quicksort, Randomized Algorithms
Problem set 1 due
Problem set 2 out
R3 Heapsort, Dynamic Sets, Priority Queues
L5
Linear-time Sorting: Lower Bounds, Counting Sort, Radix
Sort
L6 Order Statistics, Median
R4
Applications of Median
Bucketsort
L7 Hashing, Hash Functions
Problem set 2 due
Problem set 3 out
L8 Universal Hashing, Perfect Hashing Homework lab tonight
R5 Quiz 1 Review Problem set 3 due
Q1 Quiz 1, In-class
R6 Binary Search Trees, Tree Walks
L9
Relation of BSTs to Quicksort
Analysis of Random BST
Problem set 4 out
L1
0
Red-black Trees, Rotations, Insertions, Deletions
R7 2-3 Trees, B-trees
L1
1
Augmenting Data Structures, Dynamic Order Statistics,
Interval Trees
Problem set 4 due
Problem set 5 out
评论0
最新资源