Theoretical analysis of various algorithms: topics include sorting, searching, selection, polynomial evaluation, NP completeness, decidability.
(3,0 Credit hours)