.c om ng th an co Algorithm Analysis and Design du o ng Dr Truong Tuan Anh cu u Faculty of Computer Science and Engineering Ho Chi Minh City University of Technology VNU- Ho Chi Minh City CuuDuongThanCong.com https://fb.com/tailieudientucntt .c om References ng [1] Cormen, T H., Leiserson, C E, and Rivest, R L., Introduction to Algorithms, The MIT Press, 2009 an co [2] Levitin, A., Introduction to the Design and Analysis of Algorithms, 3rd Edition, Pearson, 2012 du o ng th [3] Sedgewick, R., Algorithms in C++, AddisonWesley, 1998 cu u [4] Weiss, M.A., Data Structures and Algorithm Analysis in C, TheBenjamin/Cummings Publishing, 1993 CuuDuongThanCong.com https://fb.com/tailieudientucntt Course Outline c om Basic concepts on algorithm analysis and design ng Divide-and-conquer th an Transform-and-conquer co Decrease-and-conquer ng Dynamic programming and greedy algorithm du o Backtracking algorithms cu u NP-completeness Approximation algorithms CuuDuongThanCong.com https://fb.com/tailieudientucntt Able to analyze the complexity of the algorithms (recursive or iterative) and estimate the efficiency of the algorithms Improve the ability to design algorithms in different areas Able to discuss on NP-completeness an du o u cu „ ng th „ co ng „ c om Course outcomes CuuDuongThanCong.com https://fb.com/tailieudientucntt ng co an th ‰ Sakai Website: www4.hcmut.edu.vn/~anhtt/ ng ‰ du o „ u „ Class Email: anhtt@hcmut.edu.vn Slides: cu „ c om Contacts CuuDuongThanCong.com https://fb.com/tailieudientucntt u du o ng th an co ng Recursion and recurrence relations Analysis of algorithms Analysis of iterative algorithms Analysis of recursive algorithms Algorithm design strategies Brute-force algorithm design cu .c om Outline CuuDuongThanCong.com https://fb.com/tailieudientucntt Recursion c om Recurrence relation ng th an co ng Example 1: Factorial function N! = N.(N-1)! if N ≥ 0! = The definition for a recursive function which contains some integer parameters is called a recurrence relation cu u du o function factorial (N: integer): integer; begin if N = then factorial: = else factorial: = N*factorial (N-1); end; CuuDuongThanCong.com https://fb.com/tailieudientucntt Recurrence relation ng co th an Recurrence relation: FN = FN-1 + FN-2 for N ≥ F0 = F1 = 1, 1, 2, 3, 5, 8, 13, 21, … c om Example 2: Fibonacci number cu u du o ng function fibonacci (N: integer): integer; begin if N