Books & Videos

Table of Contents

Chapter: BinarySearch

Efficient Searching using BinaryArraySearch and Binary Search Trees Part 1

26m 18s

Efficient Searching using BinaryArraySearch and Binary Search Trees Part 2

30m 9s

Creating a Balanced Binary Search Tree from a Sorted List

06m 22s

An Informal Introduction to the Analysis of Algorithms

38m 54s

Chapter: O (n log n) Behavior

MergeSort: A Divide and Conquer Algorithm

45m 32s

Using MergeSort to Sort External Data

11m 5s

Chapter: Mathematical Algorithms

Mathematical Algorithms: Exponentiation By Squaring

37m 13s

Using Exponentiation by Squaring to Determine Whether an Integer Is Prime

10m 24s

Chapter: Brute Force Algorithms

Brute Force: An Algorithm for Solving Combinatoric Problems

45m 44s

Using Brute Force to Generate Magic Squares

16m 46s

Chapter: K-Dimensional Trees

KD Trees: Efficient Processing of Two-Dimensional Datasets Part 1

38m 9s

KD Trees: Efficient Processing of Two-Dimensional Datasets Part 2

13m 45s

Using KD Trees to Compute Nearest Neighbor Queries

13m 56s

Chapter: Graph Algorithms

Graph Algorithms: Depth First Search Part 1

26m 56s

Graph Algorithms: Depth First Search Part 2

18m 43s

Using Depth First Search to Construct a Rectangular Maze

11m 55s

Chapter: AllPairsShortestPath

Graph Algorithms: All Pairs Shortest Path

40m 48s

Using Dynamic Programming to Compute Minimum Edit Distance

08m 4s

Chapter: Heap Data Structure

The Heap Data Structure and Its Use in HeapSort

26m 52s

Using HeapSort to Sort a Collection

07m 38s

Chapter: Single-Source Shortest Path

Single-Source Shortest Path: Using Priority Queues

35m 23s

Using Priority Queues to Compute the Minimum Spanning Tree

07m 10s

Chapter: Summary

Course Summary

01m 56s