Lecture 1 - Algorithms, properties of algorithms, time
complexity and space
complexity, asymptotic behaviour of functions, analysis of
algorithms,
main complexity classes.
Lecture 2 - Correctness of algorithms:
preconditions, postconditions, loop
invariants, weakest precondition, structural rules, total
correctness
and partial correctness, halting problem.