

Course on Analysis of
Algorithms
Dr.
Manuel Carcenac
(manuel.carcenac@gmail.com)
The following course lecture notes are freely available to
anyone interested.
They may be used and modified without any restrictions.
Chapters: Part I: Analyzing a pseudocode [ pdf ; doc ] running time  order of growth  asymptotic notations  algorithmic complexity  recursion tree method Part II: Programming paradigms [ pdf ; doc ] brute force  divide and conquer  binary search  merge sort  greedy algorithm  activity selection problem  fractional knapsack problem  dynamic programming  matrix chain multiplication problem  longest common
subsequence (LCS) problem
other available courses
(Java, Graphics in Java, Advanced 3D Graphics in Java,

