Analysis of

Algorithms

D & A of

Algorithms

Design & Analysis

of Algorithms ?

CMSC 441 Section 0201Design & Analysis of

Algorithms

Instructor: Dr. LomonacoGrading Policy:

• Course Grade = (25% Ex1)+(25% Ex2)+(25% Hwk)+ (25% Fin)• There are no make-up exams !!!

• Hwk Avg for wkly hwk = Lowest 1 (or 2) hwks dropped,

and remaining hwks averaged• Late homework will not be accepted !!!

http://www.csee.umbc.edu/~lomonaco/

The Big Picture

The Software Challenge:

• Create even larger more efficient algorithms: Design & Analysis of Algorithms

• Create programs that meet design specs: Program Verification• Create readable & understandable

programs: Program Documentation

• Create platform independent programs: Portability

The Big Picture

• High Level Mathematics

• High Level Physics

• High Level Analytical Thinking

To be and to stay competitive, we need learn to “think ahead of the curve”

This means continually learning how to use more sophisticated approaches to the software challenge.

Those who choose not to continue learning newmore sophisticated approaches to

programmingwill quickly become obsolete, and be easily

“Out Sourced !!!”

Shudder !!!

Course Objectives

• Design efficient algorithms

• Analyze the efficiency of algorithms

Our course objectives are to learn how to:

Consider an algorithm A for solving a problem P :

AlgorithmA

Input

Output

ProblemInstance

Solution

S A

• How efficient is the algorithm ?

• What do we mean by efficiency ?

Asymptotic Notation

AsymptoticUpper Bound

Big-O Notation

AsymptoticLower Bound

Big-W Notation

Tight Asymptotic

Bound

Big-Q Notation