| |
|
Blog捲：
-
最佳的自由計算機它訓練&講解
-
自由計算機和它預定
-
EducationOnlineForComputers.com Blogs
Lecture 1: Introduction
to Algorithmics
(36 pages, 377kb)
Lecture 2: Recurrences
(49 pages, 455kb)
Lecture 3: Balanced
Search Trees
(46 pages, 479kb)
Lecture 4: Pure
Graph Algorithms
(36 pages, 408kb)
Lecture 5: Greedy
Method
(48 pages, 488kb)
Lecture 6: Amortization
Method
(42 pages, 418kb)
Lecture 7:
Dynamic
Programming
(38 pages, 378kb)
Lecture 8:
Randomized
Algorithms - Quick Probability
(31 pages, 317kb)
Lecture 9: Randomization
and Derandomization
(9 pages, 132kb)
Lecture 14: Minimum
Cost Paths
(25 pages, 265kb)
Lecture 30:
NP
Completeness
(20 pages, 246kb)
Popularity: 8% [?]
Related Posts:
- Open E-Commerce Courseware:
- The Algorithm Design Manual
- Free Algorithms Training Course
- Computer Graphics Lectures from Harvard University
- Global Optimization Algorithms eBook
Tags for this post>> Algorithms
No comments yet.
RSS feed for comments on this post.
You must be logged in to post a comment.
Powered by WordPress
|
