算法分析与设计(双语)
霍红卫 Xidian University
检索结果共
个
1
UNION-FIND
1.1
Administration, Introduction, Dynamic connectivity
1.2
Quick find, Quick union, Improvements.
1.3
Application: Percolation
2
ANALYSIS OF ALGORITHMS
2.1
Introduction, Observations, Mathematical models
2.2
Order-of-growth classifications, Theory of algorithms, Memory
3
MERGESORT
3.1
Top-down mergesort, Bottom-up mergesort,
3.2
Sorting complexity, Comparators, Stability
4
QUICKSORT
4.1
Quicksort, Average-case analysis, Selection
4.2
Dijkstra 3-way partitioning, 3-way quicksort for duplicate keys
4.3
Engineering a systemsort
5
PRIORITY QUEUES
5.1
API and elementary implementations, Applications
5.2
Binary heaps, basic ops: Swim and Sink, Heapsort.
5.3
Application: event-driven simulation
6
SYMBOL TABLES
6.1
API and elementary implementations, Ordered operations
7
UNDIRECTED GRAPHS. DIRECTED GRAPHS
8
MINIMUM SPANNING TREES
8.1
Introduction, Greedy algorithm, Edge-weighted graph API
8.2
Kruskal's algorithm: correctness proof, implementation challenge
8.3
Prim's algorithm: proof of correctness, Implementation challenge.
8.4
Lazy implementation. Eager implementation
8.5
Scientific application: clustering
9
SHORTEST PATHS
9.1
APIs, Shortest-paths properties. Generic shortest-paths algorithm
9.2
Dijkstra's algorithm (Greedy): correctness proof, PQ implementation
9.3
Application: Map routing
9.4
Shortest paths in edge-weighted DAGs
9.5
Application: Seam carving
9.6
Applications: Parallel job scheduling, Critical path method
9.7
Shortest paths with negative weights: Bellman-Ford algorithm (DP)
9.8
Negative cycle application: Arbitrage detection
10
STRING SORTS
10.1
Strings in Java, key-indexed counting
10.2
LSD radix sort, MSD radix sort, 3-way radix quicksort
10.3
Suffix arrays (SA)
10.4
SA application: The Burrows-Wheeler transform (BWT)
11
DATA COMPRESSION
11.1
Introduction, run-length coding
11.2
Huffman compression, LZW compression
11.3
Compressed suffix arrays (CSA)
12
ALGORITHM DESIGN: REVIEW
12.1
Analysis of algorithms
12.2
Greedy, Divide-and-conquer, Dynamic programming
12.3
Network flow
12.4
Randomized algorithms
12.5
Intractability
上一页
下一页
