普林斯顿算法学习手册

目录

• 普林斯顿算法第四版重点算法总结
• 普林斯顿算法第四版全部视频
• 普林斯顿算法第四版的所有ppt

普林斯顿算法第四版重点算法总结

请保存到收藏夹，当做你学习算法第四版的目录。

返回页首

第1章 基础

 1.基础算法

第2章 排序

 2.排序算法

第3章 查找

 3.查找算法

第4章 图

 4.图算法

第5章 字符串

 5.字符串算法

[第6章 背景]

 6.其余背景算法

新增 无注释 No Comment 版本

 无注释版本

无注释版本 可以用来复习。复习时，自己主动给关键部分写注释，再对照原来的注释，看看是否真正理解。

普林斯顿算法第四版全部视频。

返回页首

Part 1

Chapter 1: Fundamentals

• 1. Course Introduction

• 2. Dynamic Connectivity

• 3. Quick Find

• 4. Quick Union

• 5. Quick Union Improvements

• 6. Union Find Applications

• 1. Analysis of Algorithms Introduction

• 2. Observations

• 3. Mathematical Models

• 4. Order of Growth Classifications

• 5. Theory of Algorithms

• 6. Memory

• 1. Stacks

• 2. Resizing Arrays

• 3. Queues

• 4. Generics

• 5. Iterators

• 6. Stack and Queue Applications

Chapter 2: Sorting

• 1. Sorting Introduction

• 2. Selection Sort

• 3. Insertion Sort

• 4. Shellsort

• 5. Shuffling

• 6. Convex Hull

• 1. Mergesort

• 2. Bottom up Mergesort

• 3. Sorting Complexity

• 4. Comparators

• 5. Stability

• 1. Quicksort

• 2. Selection

• 3. Duplicate Keys

• 4. System Sorts

Chapter 3: Searching

• 1. APIs and Elementary Implementations

• 2. Binary Heaps

• 3. Heapsort

• 4. Event Driven Simulation

• 1. Symbol Table API

• 2. Elementary Implementations

• 3. Ordered Operations

• 4. Binary Search Trees

• 5. Ordered Operations in BSTs

• 6. Deletion in BSTs

• 1. Search Trees

• 2. Red Black BSTs

• 3. B Trees

• 1. Range Search

• 2. Line Segment Intersection

• 3. Kd Trees

• 4. Interval Search Trees

• 5. Rectangle Intersection

• 1. Hash Functions

• 2. Separate Chaining

• 3. Linear Probing

• 4. Hash Table Context

• 5. Symbol Table Applications Sets

• 6. Symbol Table Applications Dictionary Clients

• 7. Symbol Table Applications Indexing Clients

• 8. Symbol Table Applications Sparse Vectors

返回页首

Part II

Chapter 4: Graphs

• 2. Introduction to Graphs

• 3. Graph API

• 4. Depth First Search

• 5. Breadth First Search

• 6. Connected Components

• 7. Graph Challenges

• 1. Introduction to Digraphs

• 2. Digraph API

• 3. Digraph Search

• 4. Topological Sort

• 5. Strong Components

• 1. Introduction to MSTs

• 2. Greedy Algorithm

• 3. Edge Weighted Graph API

• 4. Kruskals Algorithm

• 5. Prim's Algorithm

• 6. Minimum Spanning Trees Context

• 1. Shortest Paths APIs

• 2. Shortest Path Properties

• 3. Dijkstras Algorithm

• 4. Edge Weighted DAGs

• 5. Negative Weights

• 1. Introduction to Maxflow

• 2. Ford Fulkerson Algorithm

• 3. Maxflow Mincut Theorem

• 4. Running Time Analysis

• 5. Java Implementation

• 6. Maxflow Applications

Chapter 5: Strings

• 1. Strings in Java

• 2. Key Indexed Counting

• 3. Least Significant Digit First String Radix Sort

• 4. Most Significant Digit First String Radix Sort

• 5. 3 Way Radix Quicksort

• 6. Suffix Arrays

• 1. R Way Tries

• 2. Ternary Search Tries

• 3. Character Based Operations

• 1. Introduction to Substring Search

• 2. Brute-Force Substring Search

• 3. Knuth-Morris Pratt

• 4. Boyer-Moore

• 5. Rabin-Karp

• 1. Regular Expressions

• 2. Regular Expressions and Deterministic Finite Automatons (DFAs)

• 3. Deterministic Finite Automatons (DFAs) Simulation

• 4. Deterministic Finite Automatons (DFAs) Construction

• 5. Regular Expression Applications

• 1. Introduction to Data Compression

• 2. Run Length Coding

• 3. Huffman Compression

• 4. Lempel-Ziv-Welch (LZW) Compression

Chapter 6: Context

• 1. Introduction to Reductions

• 2. Designing Algorithms

• 3. Establishing Lower Bounds

• 4. Classifying Problems

• 1. Brewer's Problem

• 2. Simplex Algorithm

• 3. Simplex Implementations

• 4. Linear Programming Reductions

• 1. Introduction to Intractability

• 2. Search Problems

• 3. P vs NP

• 4. Classifying Problems

• 5. NP Completeness

• 6. Coping with Intractability

普林斯顿算法第四版的所有ppt。

返回页首

Chapter 0: Intro

• 00Intro.pdf

Chapter 1: Fundamentals

• 13StacksAndQueues.pdf
• 14AnalysisOfAlgorithms.pdf
• 14DemoBinarySearch.pdf
• 15UnionFind.pdf

Chapter 2: Sorting

• 21ElementarySorts.pdf
• 22Mergesort.pdf
• 23Quicksort.pdf
• 23DemoPartitioning.pdf
• 23DemoQuickSelect.pdf
• 24PriorityQueues.pdf

Chapter 3: Searching

• 31ElementarySymbolTables.pdf
• 32BinarySearchTrees.pdf
• 33BalancedSearchTrees.pdf
• 99GeometricSearch.pdf
• 34HashTables.pdf
• 35SearchingApplications.pdf

Chapter 4: Graphs

• 41UndirectedGraphs.pdf
• 42DirectedGraphs.pdf
• 43MinimumSpanningTrees.pdf
• 43DemoGreedy.pdf
• 43DemoKruskal.pdf
• 43DemoPrim.pdf
• 44ShortestPaths.pdf
• 44DemoDijkstra.pdf
• 44DemoAcyclicSP.pdf
• 44DemoBellmanFord.pdf

Chapter 5: Strings

• 51StringSorts.pdf
• 51DemoKeyIndexedCounting.pdf
• 52Tries.pdf
• 53SubstringSearch.pdf
• 54RegularExpressions.pdf
• 55DataCompression.pdf

Chapter 6: Context

• 64MaxFlow.pdf
• 99LinearProgramming.pdf