Канал: Algorithms with Attitude

Recurrence Relations: Master Method

Recurrence Relations: Master Method

Recurrence Relations: Three Examples

Recurrence Relations: Three Examples

Floyd-Warshall All-Pairs Shortest Paths: A Dynamic Programming Approach

Floyd-Warshall All-Pairs Shortest Paths: A Dynamic Programming Approach

Dynamic Programming: Subset Sum

Dynamic Programming: Subset Sum

Disjoint Sets: the Union-Find Data Structure

Disjoint Sets: the Union-Find Data Structure

Introduction to Dynamic Programming: Fibonacci Numbers

Introduction to Dynamic Programming: Fibonacci Numbers

Introduction to P and NP: The Clique Problem

Introduction to P and NP: The Clique Problem

Boruvka's Minimum Spanning Tree Algorithm

Boruvka's Minimum Spanning Tree Algorithm

NP-Complete Reductions: Clique, Independent Set, Vertex Cover, and Dominating Set

NP-Complete Reductions: Clique, Independent Set, Vertex Cover, and Dominating Set

Dynamic Programming: the Rod Cutting Problem

Dynamic Programming: the Rod Cutting Problem

Prim's Minimum Spanning Tree Algorithm (Jarnik's Algorithm)

Prim's Minimum Spanning Tree Algorithm (Jarnik's Algorithm)

Kruskal's Minimum Spanning Tree Algorithm

Kruskal's Minimum Spanning Tree Algorithm

Introduction to Minimum Spanning Trees

Introduction to Minimum Spanning Trees

Linear Time Sorting: Counting Sort, Radix Sort, and Bucket Sort

Linear Time Sorting: Counting Sort, Radix Sort, and Bucket Sort

Lower Bounds for Comparison Based Sorting: Decision Trees

Lower Bounds for Comparison Based Sorting: Decision Trees

Runtime Analysis for Quick Sort and Quick Select

Runtime Analysis for Quick Sort and Quick Select

Kosaraju's Algorithm for Strongly Connected Components

Kosaraju's Algorithm for Strongly Connected Components

Depth First Search Based Topological Sort

Depth First Search Based Topological Sort

Kahn's Algorithm for Topological Sorting

Kahn's Algorithm for Topological Sorting

Merge Sort: Top-Down and Bottom-Up

Merge Sort: Top-Down and Bottom-Up

Quick Sort and Quick Select

Quick Sort and Quick Select

You're Not a Freakin' Moron (The Imposter Syndrome)

You're Not a Freakin' Moron (The Imposter Syndrome)

Geometric Series for Algorithms Analysis

Geometric Series for Algorithms Analysis

Introduction to Topological Sorting in Directed Acyclic Graphs

Introduction to Topological Sorting in Directed Acyclic Graphs

Graphs: Depth First Search (DFS) with Example

Graphs: Depth First Search (DFS) with Example

Directed Acyclic Graph (DAG) Single Source Shortest Paths with Example

Directed Acyclic Graph (DAG) Single Source Shortest Paths with Example

Dijkstra's Single Source Shortest Paths Algorithm with Example

Dijkstra's Single Source Shortest Paths Algorithm with Example

Bellman Ford Single Source Shortest Paths Algorithm with Example

Bellman Ford Single Source Shortest Paths Algorithm with Example

Introduction to Single Source Shortest Paths

Introduction to Single Source Shortest Paths

Graphs: Breadth First Search (BFS) with Example

Graphs: Breadth First Search (BFS) with Example

Graphs: Representation

Graphs: Representation

Introduction to Graphs

Introduction to Graphs

Linked Lists and Dynamic Arrays: Misuse and Abuse

Linked Lists and Dynamic Arrays: Misuse and Abuse

Stacks, Queues, and Double Ended Queues (Deques)

Stacks, Queues, and Double Ended Queues (Deques)

Advanced Dynamic Arrays

Advanced Dynamic Arrays

Dynamic Arrays, aka ArrayLists

Dynamic Arrays, aka ArrayLists

Lists, Iterators, and Abstract Data Types

Lists, Iterators, and Abstract Data Types

Linked Lists

Linked Lists

Recurrence Relations: Recursion Tree Method

Recurrence Relations: Recursion Tree Method

Recurrence Relations: Substitution Method

Recurrence Relations: Substitution Method

Recurrence Relations and Recursion

Recurrence Relations and Recursion

Asymptotic Notation: Runtime of Simple Programs And Loops

Asymptotic Notation: Runtime of Simple Programs And Loops

Asymptotic Notation: Usage

Asymptotic Notation: Usage

Asymptotic Notation: Proofs, Properties, and Pictures

Asymptotic Notation: Proofs, Properties, and Pictures

Introduction for Students

Introduction for Students

Iterated Functions and log*

Iterated Functions and log*

Asymptotic Notation: Definitions

Asymptotic Notation: Definitions

Optimized Heapify

Optimized Heapify

New Channel Teaser

New Channel Teaser

Binary Heaps for Priority Queues

Binary Heaps for Priority Queues

Linear Time BuildHeap

Linear Time BuildHeap

Introduction to Binary Heaps (MaxHeaps)

Introduction to Binary Heaps (MaxHeaps)

Heap Sort

Heap Sort