Algorithms, computational complexity, asymptotic notations, pseudocode, greedy algorithms, easy vs. hard problems.
Algorithms, growth of functions, complexity
Textbook 42 pages
Algorithms, computational complexity, asymptotic notations.
Lecture notes
Pseudocode, algorithmic paradigms, greedy algorithms, easy vs. hard problems.
Linear search, binary search, bubble sort, insertion sort (Rosen Section 3.1)
Problems
Solutions
Big O estimates (Rosen Section 3.2)
Big O estimates (continued) (Rosen Section 3.3)