CS 332: Algorithms

9/18/2000


Click here to start


Table of Contents

CS 332: Algorithms

Administrivia

Review: Heaps

Review: Heaps

Review: The Heap Property

Review: Heapify()

Review: BuildHeap()

Review: Heapsort()

Tying It Into The Real World

Tying It Into The “Real World”

Combat Billiards: Simulating The Physics

Simulating The Physics

Review: Priority Queues

Priority Queue Operations

Implementing Priority Queues

Implementing Priority Queues

Implementing Priority Queues

Back To Combat Billiards

Using A Priority Queue For Event Simulation

Quicksort

Quicksort

Quicksort Code

Partition

Partition In Words

Partition Code

Analyzing Quicksort

Analyzing Quicksort

Analyzing Quicksort

Analyzing Quicksort

Analyzing Quicksort

Analyzing Quicksort

Analyzing Quicksort

Improving Quicksort

Coming Up

Author: David Luebke

Email: luebke@cs.virginia.edu

Home Page: http://www.cs.virginia.edu/~luebke

Other information:
CS 551: Intro Computer Graphics David Luebke, UVA

Download presentation source