Algorithm Analysis (CSC 301 2015F) : Outlines

Outline 04: Asymptotic Algorithm Analysis, Continued


Held: Friday, 4 September 2015

Back to Outline 03 - Reflective Activities. On to Outline 05 - Divide and Conquer Approaches.

Summary

We continue our explorations of algorithm analysis.

Related Pages

Overview

Administrivia

Upcoming Work

Extra Credit

Academic

Peer

Asymptotic analysis, reviewed

Additional properties of Big-Oh

Careful loop analysis

function conundrum(n)
  r := 0
  for i := 1 to n do
    for j := i + 1 to n do
      for k := i + j − 1 to n do 
        r := r + 1
  return(r)