ANALYSIS OF ALGORITHMS AND DESIGN
This course is an introduction to the analysis of the algorithms. Basic analysis of the efficiency of algorithms. Detailed discussion with suitable examples of several approaches to algorithm design: brute force, divide and conquer, decrease and conquer, transform and conquer, space and time trade-offs, dynamic programming, greedy techniques, iterative improvement.
This course is an introduction to the analysis of the algorithms. Basic analysis of the efficiency of algorithms. Detailed discussion with suitable examples of several approaches to algorithm design: brute force, divide and conquer, decrease and conquer, transform and conquer, space and time trade-offs, dynamic programming, greedy techniques, iterative improvement.
- Lecturer: PROF. MADYA DR. MD. JAN BIN NORDIN
- Lecturer: DR. BAHARI BIN IDRUS
- Lecturer: DR. AFZAN BINTI ADAM
- Lecturer: DR. HADI AFFENDY BIN DAHLAN