Learning Data Structures and Algorithms

2015
7h 32m

Chapter 1 – Introduction
Introduction And Course Overview
time: 04min00s
About The Author
01min16s
How To Access Your Working Files
01min15s
Chapter 2 – Complexity Theory
Complexity Theory
03min56s
Big O Notation
07min02s
Typical Runtime Functions
04min37s
Comparing Runtime Functions
05min27s
P And NP
04min04s
Chapter 3 – Numerical Algorithms
Random Numbers
02min19s
Linear Congruential Generators
05min04s
Randomizing Arrays – Part 1
03min47s
Randomizing Arrays – Part 2
04min31s
GCD
04min09s
LCM
03min28s
Prime Factorization – Part 1
04min59s
Prime Factorization – Part 2
02min43s
Finding Primes
03min24s
Testing Primality
03min45s
Numerical Integration
05min11s
Chapter 4 – Linked Lists
Singly Linked Lists – Part 1
06min48s
Singly Linked Lists – Part 2
02min22s
Sorted Linked Lists
03min22s
Sorting With Linke Lists04m 07s
Doubly Linked Lists 03m 51s
Chapter 5 – Arrays
One-Dimensional Arrays 05m 10s
Triangular Arrays – Part 1 04m 13s
Triangular Arrays – Part 2 03m 17s
Sparse Arrays – Part 1 05m 27s
Sparse Arrays – Part 2 03m 19s
Chapter 6 – Stacks And Queues
Stacks 02m 32s
Stack Algorithms 03m 26s
Double Stacks 02m 08s
Queues 05m 49s
Chapter 7 – Sorting
Sorting Algorithms 03m 03s
Insertionsort 06m 27s
Selectionsort 04m 46s
Quicksort – Part 1 05m 40s
Quicksort – Part 2 07m 55s
Heapsort – Part 1 06m 17s
Heapsort – Part 2 05m 21s
Heapsort – Part 3 05m 39s
Mergesort – Part 1 03m 55s
Mergesort – Part 2 03m 41s
Bubblesort – Part 1 04m 51s
Bubblesort – Part 2 04m 18s
Countingsort – Part 1 04m 45s
Countingsort – Part 2 03m 35s
Sorting Summary 02m 51s
Chapter 8 – Searching
Linear Search 02m 11s
Binary Search 05m 15s
Interpolation Search 05m 27s
Chapter 9 – Hash Tables
Hash Tables 04m 32s
Chaining 05m 23s
Open Addressing – Basics 07m 25s
Open Addressing – Linear Probing 04m 48s
Open Addressing – Quadratic Probing 04m 22s
Open Addressing – Double Hashing 05m 55s
Chapter 10 – Recursion
Recursion Basics 05m 37s
Fibonacci Numbers 06m 08s
Tower Of Hanoi 06m 08s
Koch Curves 04m 32s
Hilbert Curves 04m 32s
Gaskets 04m 52s
Removing Tail Recursion 03m 58s
Removing Recursion With Stacks 03m 56s
Fixing Fibonacci 07m 25s
Selections 04m 15s
Permutations 04m 12s
Chapter 11 – Backtracking Algorithms
Backtracking 06m 03s
The Eight Queens Problem – Part 1 06m 00s
The Eight Queens Problem – Part 2 04m 03s
The Eight Queens Problem – Part 3 03m 48s
The Knights Tour 04m 20s
Chapter 12 – Trees
Tree Terms 05m 06s
Binary Tree Properties 06m 25s
Traversals – Preorder
03m 54s
Traversals – Postorder 02m 57s
Traversals – Inorder 02m 47s
Traversals – Breadth-First 02m 57s
Building Sorted Trees 03m 56s
Editing Sorted Trees 04m 36s
Chapter 13 – Balanced Trees
Why Do You Need Balanced Trees? 04m 04s
B-Trees – B-Tree Basics 07m 18s
B-Trees – Adding Items 05m 16s
B-Trees – Removing Items 04m 16s
Chapter 14 – Decision Trees
Definition 05m 36s
Exhaustive Search 06m 27s
Branch And Bound 08m 26s
Heuristics 07m 38s
Chapter 15 – Network Algorithms
Network Terminology 03m 31s
Network Classes 04m 52s
Depth-First Traversal 05m 21s
Breadth-First Traversal 02m 43s
Spanning Trees – Part 1 04m 12s
Spanning Trees – Part 2 03m 58s
Shortest Paths – Part 1 07m 27s
Shortest Paths – Part 2 08m 41s
Chapter 16 – Wrap-Up
Wrap-Up