Algorithms with Attitude
Algorithms, data structures, and their analysis.
I am a professor at San Jose State University. There are a lot of freaking David Taylors out there, even a handful if you limit it only to computer scientists, so I go by David Scot Taylor.
Recurrence Relations: Master Method
Recurrence Relations: Three Examples
Кратчайшие пути Флойда-Уоршелла для всех пар вершин: подход динамического программирования
Dynamic Programming: Subset Sum
Disjoint Sets: the Union-Find Data Structure
Introduction to Dynamic Programming: Fibonacci Numbers
Введение в P и NP: проблема клики
Boruvka's Minimum Spanning Tree Algorithm
NP-Complete Reductions: Clique, Independent Set, Vertex Cover, and Dominating Set
Dynamic Programming: the Rod Cutting Problem
Prim's Minimum Spanning Tree Algorithm (Jarnik's Algorithm)
Kruskal's Minimum Spanning Tree Algorithm
Introduction to Minimum Spanning Trees
Linear Time Sorting: Counting Sort, Radix Sort, and Bucket Sort
Нижние границы для сортировки на основе сравнения: деревья решений
Runtime Analysis for Quick Sort and Quick Select
Kosaraju's Algorithm for Strongly Connected Components
Depth First Search Based Topological Sort
Kahn's Algorithm for Topological Sorting
Merge Sort: Top-Down and Bottom-Up
Quick Sort and Quick Select
You're Not a Freakin' Moron (The Imposter Syndrome)
Geometric Series for Algorithms Analysis
Introduction to Topological Sorting in Directed Acyclic Graphs
Graphs: Depth First Search (DFS) with Example
Directed Acyclic Graph (DAG) Single Source Shortest Paths with Example
Dijkstra's Single Source Shortest Paths Algorithm with Example
Bellman Ford Single Source Shortest Paths Algorithm with Example
Introduction to Single Source Shortest Paths
Graphs: Breadth First Search (BFS) with Example