CS223-0122-Analysis

CS223-0122-Analysis - Algorithm Analysis Neil Tang...

Info iconThis preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon
CS223 Advanced Data Structures and Algorithms 1 Algorithm Analysis Algorithm Analysis Neil Tang Neil Tang 01/22/2008 01/22/2008
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
CS223 Advanced Data Structures and Algorithms 2 Algorithm and Complexity Algorithm and Complexity Algorithm : A clearly specified set of instructions to be followed to solve a problem. Characteristics of an algorithm: - input - output - stop on any input Time complexity: The number of operations required. Best vs. average vs. worst case complexity. Space complexity: The amount of memory required.
Background image of page 2
3 Asymptotic Notations Asymptotic Notations T(N) = O(f(N)) if there exist positive constants c and n 0 , s.t. T(N) cf(N) when N n 0 T(N) = (g(N)) if there exist positive constants c and n 0 , s.t. T(N) cg(N) when N n 0 T(N) = Θ (h(N)) iff T(N) = O(h(N)) and T(N) = (h(N)) T(N) = o(p(N)) if T(N) = O(p(N)) and T(N) Θ (p(N)) O-notation is used to determine an upper bound on the order of growth
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 4
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 04/17/2008 for the course CS 223 taught by Professor Tang during the Spring '07 term at MSU Bozeman.

Page1 / 16

CS223-0122-Analysis - Algorithm Analysis Neil Tang...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online