Algorithm correct answers a well defined computational procedure that takes a value of set of
values as input and produces a value or set of values as output; it completes in a finite execution
time
Requirements of algorithm correct answers Halts and produces the correct output for every input
O notation (def and math def) correct answers Upper bound on asymptotic behaviour
T(n)<c*f(n) for n>n0 and C>0
o-notation correct answers upper bound that is not tight
Omega-Notation correct answers lower bound on asymptotic behaviour
T(n)> c*f(n) for n>n0 and c>0
w-notation correct answers lower bound that is not tight
Theta-Notation correct answers tight bound on asymptiotic behaviour (must be both O and
Omega)
Loop invarient correct answers a statement that is true across all loop iterations and is typically
parameterized by index value i
3 properties of loop invarient correct answers initialization: initially some property must be true
maintenence: after each iteration this property must still be true
termination: after final iteration this property is true for all list