CS 332: Algorithms

Administrivia

Review Of Topics

Review of Topics

Review Of Topics

Review: Induction

Proof By Induction

Induction Example:
Gaussian Closed Form

Induction Example:
Geometric Closed Form

Review: Analyzing Algorithms

An Example: Insertion Sort

An Example: Insertion Sort

An Example: Insertion Sort

An Example: Insertion Sort

An Example: Insertion Sort

An Example: Insertion Sort

An Example: Insertion Sort

An Example: Insertion Sort

An Example: Insertion Sort

An Example: Insertion Sort

An Example: Insertion Sort

An Example: Insertion Sort

An Example: Insertion Sort

An Example: Insertion Sort

An Example: Insertion Sort

An Example: Insertion Sort

An Example: Insertion Sort

An Example: Insertion Sort

An Example: Insertion Sort

An Example: Insertion Sort

An Example: Insertion Sort

An Example: Insertion Sort

An Example: Insertion Sort

An Example: Insertion Sort

An Example: Insertion Sort

An Example: Insertion Sort

An Example: Insertion Sort

An Example: Insertion Sort

An Example: Insertion Sort

Insertion Sort

Analyzing Insertion Sort

Upper Bound Notation

Big O Fact

Lower Bound Notation

Asymptotic Tight Bound

Other Asymptotic Notations

Review: Recurrences

Review: Solving Recurrences

Review: Substitution Method

Review: Substitution Method

Substitution Method

Review: Iteration Method

Review:

Review:

Review:

Review:

Review: The Master Theorem

Review: The Master Theorem

Slide 59

Review: Merge Sort

Review: Analysis of Merge Sort

Review: Heaps

Review: Heaps

Review: The Heap Property

Review: Heapify()

Review: BuildHeap()

Review: Heapsort()

Review: Priority Queues

Priority Queue Operations

Implementing Priority Queues

Implementing Priority Queues

Implementing Priority Queues

Example: Combat Billiards

Review: Quicksort

Review: Quicksort

Review: Quicksort Code

Review: Partition Code

Review: Analyzing Quicksort

Review: Analyzing Quicksort

Review: Analyzing Quicksort

Review: Analyzing Quicksort

Review: Improving Quicksort

Sorting Summary

Sorting Summary

Sorting Summary

Sorting Summary

Review: Comparison Sorts

Review: Counting Sort

Review: Counting Sort

Review: Radix Sort

Review: Binary Search Trees

Review: Binary Search Trees

Review: Inorder Tree Walk

Review: BST Search

Review: BST Search (Iterative)

Review: BST Insert

Review: Sorting With BSTs

Review: Sorting With BSTs

Review: More BST Operations

Review: More BST Operations

Review: Red-Black Trees

Red-Black Properties

Operations On RB Trees

RB Trees: Rotation

Review: Skip Lists

Review: Skip Lists

Review: Skip List Search

Review: Skip List Insert

Review: Skip Lists

Review: Hashing Tables

Review: Hash Tables

Review: Direct Addressing

Review: Hash Functions

Review: Resolving Collisions

Review: Chaining

Review: Analysis Of Hash Tables

Review: Choosing A Hash Function

Review: The Division Method

Review: The Multiplication Method

Review: Universal Hashing

Review: Universal Hashing

Review: A Universal Hash Function

Review: Dynamic Order Statistics

Review: Order Statistic Trees

Review: OS-Select

Review: OS-Select

Review: OS-Select

Review: OS-Select

Review: OS-Select

Review: OS-Select

Review: Determining The
Rank Of An Element

Review: Determining The
Rank Of An Element

Review: Determining The
Rank Of An Element

Review: Determining The
Rank Of An Element

Review: Determining The
Rank Of An Element

Review: Maintaining Subtree Sizes

Reivew: Maintaining Subtree Sizes

Review: Interval Trees

Interval Trees

Searching Interval Trees

Review: Correctness of IntervalSearch()

Review: Correctness of IntervalSearch()

Review: Correctness of IntervalSearch()