Algorithm Analysis

9/21/99

Click here to start

Table of Contents

Algorithm Analysis

Introduction

Basic Axioms

Basic Axioms (contd.)

Examples

A Simple Example

Array Access

Example : Horner?s Rule

Example: findMaximun

Average Running Times

Order-of-Magnitude Analysis

Key concepts

Interpretation of growth-rate functions

Interpretation of growth-rate functions

Properties of growth rate functions

Worst-case and average-case analyses

How to use Order-Of-Magnitude function?

How to ??

Efficiency of search algorithms

Binary search algorithm

Binary search algorithm

Efficiency of sort algorithms

Author: Bina Ramamurthy

Email: bina@cse.buffalo.edu

Home Page: http://www.cse.buffalo.edu/~bina

Download presentation source