Algo analysis
Upcoming SlideShare
Loading in...5
×
 

Algo analysis

on

  • 74 views

CSC-391. Data Structure and Algorithm course material

CSC-391. Data Structure and Algorithm course material

Statistics

Views

Total Views
74
Views on SlideShare
74
Embed Views
0

Actions

Likes
0
Downloads
1
Comments
0

0 Embeds 0

No embeds

Accessibility

Upload Details

Uploaded via as Microsoft PowerPoint

Usage Rights

© All Rights Reserved

Report content

Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
  • Full Name Full Name Comment goes here.
    Are you sure you want to
    Your message goes here
    Processing…
Post Comment
Edit your comment

Algo analysis Algo analysis Presentation Transcript

  • CSC 391
  • Polynomials in running time Desirable scaling property. When the input size doubles, the algorithm should only slow down by some constant factor C. We say that an algorithm is efficient if has a polynomial running time.
  • Cost of basic operations Observation. Most primitive operations take constant time
  • Factors affecting running time
  • ** The difference between Big O notation and Big Omega notation is that Big O is used to describe the worst case running time for an algorithm. But, Big Omega notation, on the other hand, is used to describe the best case running time for a given algorithm.
  • Big-Theta notation