Discussion:
A1Q2 Algorithm Analysis
(too old to reply)
Jacob Horbulyk
2011-09-25 20:10:25 UTC
Permalink
For A1Q2 do we have to do a formal proof showing that our psuedocode
fits within the bounds required?
cs240
2011-09-25 21:09:28 UTC
Permalink
You should briefly analyze your algorithms to justify the correctness
and the complexity. For example, you may want to state the number of
iterations your loops run and how you come up with the overall
complexity, similar to what we did in class. You don't have to formally
prove it if you think your analysis is clear enough.

Vivian
CS240 Tutor

Loading...