Bài giảng cấu trúc dữ liệu và giải thuật tìm giai thừa bằng đệ qui TS đào nam anh

DATA STRUCTURE AND ALGORITHM Recursive Factorial CẤU TRÚC DỮ LIỆU VÀ GIẢI THUẬT Tìm giai thừa đệ qui Dr Dao Nam Anh Data Structure and Algorithm Resource - Reference Slides adapted from Robert Sedgewick, and Kevin Wayne, edit by Dao Nam Anh Major Reference: • Robert Sedgewick, and Kevin Wayne, “Algorithms” Princeton University, 2011, Addison Wesley • Algorithm in C (Parts 1-5 Bundle)- Third Edition by Robert Sedgewick, Addison-Wesley • Cấu trúc liệu giải thuật, Đinh Mạnh Tường • Giải thuật lập trình, Lê Minh Hoàng, Đại Học Sư Phạm, 2002 Data Structure and Algorithm Recursive Factorial Tính giai thừa, dùng đệ qui pubic class Factorial { public static int fact(int n) { if (n == 0) return 1; else return n * fact(n-1); } public static void main(String[] args) { System.out.println(fact(3)); } } Data Structure and Algorithm n=3 environment fact(3) static int fact(int n) { if (n == 0) return 1; else return n * fact(n-1); } Data Structure and Algorithm n=3 environment fact(3) static int fact(int n) { if (n == 0) return 1; else return n * fact(n-1); } Data Structure and Algorithm n=3 environment fact(3) static int fact(int n) { if (n == 0) return 1; else return n * fact(n-1); } Data Structure and Algorithm n=3 environment n=2 environment fact(3) static int fact(int n) { if (n == 0) return 1; else return n * fact(n-1); } fact(2) static int fact(int n) { if (n == 0) return 1; else return n * fact(n-1); } Data Structure and Algorithm n=3 environment n=2 environment fact(3) static int fact(int n) { if (n == 0) return 1; else return n * fact(n-1); } fact(2) static int fact(int n) { if (n == 0) return 1; else return n * fact(n-1); } Data Structure and Algorithm n=3 environment n=2 environment fact(3) static int fact(int n) { if (n == 0) return 1; else return n * fact(n-1); } fact(2) static int fact(int n) { if (n == 0) return 1; else return n * fact(n-1); } Data Structure and Algorithm n=3 environment static int fact(int n) { if (n == 0) return 1; else return n * fact(n-1); } n=2 environment n=1 environment fact(3) fact(2) static int fact(int n) { if (n == 0) return 1; else return n * fact(n-1); } fact(1) static int fact(int n) { if (n == 0) return 1; else return n * fact(n-1); } Data Structure and Algorithm 10 n=3 environment static int fact(int n) { if (n == 0) return 1; else return n * fact(n-1); } n=2 environment n=1 environment fact(3) fact(2) static int fact(int n) { if (n == 0) return 1; else return n * fact(n-1); } fact(1) static int fact(int n) { if (n == 0) return 1; else return n * fact(n-1); } Data Structure and Algorithm 11 n=3 environment static int fact(int n) { if (n == 0) return 1; else return n * fact(n-1); } n=2 environment n=1 environment fact(3) fact(2) static int fact(int n) { if (n == 0) return 1; else return n * fact(n-1); } fact(1) static int fact(int n) { if (n == 0) return 1; else return n * fact(n-1); } Data Structure and Algorithm 12 n=3 environment static int fact(int n) { if (n == 0) return 1; else return n * fact(n-1); } n=2 environment n=1 environment n=0 environment fact(3) fact(2) static int fact(int n) { if (n == 0) return 1; else return n * fact(n-1); } fact(1) static int fact(int n) { if (n == 0) return 1; else return n * fact(n-1); } fact(0) static int fact(int n) { if (n == 0) return 1; else return n * fact(n-1); } Data Structure and Algorithm 13 n=3 environment static int fact(int n) { if (n == 0) return 1; else return n * fact(n-1); } n=2 environment n=1 environment n=0 environment fact(3) fact(2) static int fact(int n) { if (n == 0) return 1; else return n * fact(n-1); } fact(1) static int fact(int n) { if (n == 0) return 1; else return n * fact(n-1); } fact(0) static int fact(int n) { if (n == 0) return 1; else return n * fact(n-1); } Data Structure and Algorithm 14 n=3 environment static int fact(int n) { if (n == 0) return 1; else return n * fact(n-1); } n=2 environment n=1 environment n=0 environment fact(3) fact(2) static int fact(int n) { if (n == 0) return 1; else return n * fact(n-1); } fact(1) static int fact(int n) { if (n == 0) return 1; else return n * fact(n-1); } fact(0) static int fact(int n) { if (n == 0) return 1; else return n * fact(n-1); } Data Structure and Algorithm 15 n=3 environment static int fact(int n) { if (n == 0) return 1; else return n * fact(n-1); } n=2 environment n=1 environment fact(3) fact(2) static int fact(int n) { if (n == 0) return 1; else return n * fact(n-1); } fact(1) static int fact(int n) { if (n == 0) return 1; else return n * fact(n-1); } 1 Data Structure and Algorithm 16 n=3 environment static int fact(int n) { if (n == 0) return 1; else return n * fact(n-1); } n=2 environment n=1 environment fact(3) fact(2) static int fact(int n) { if (n == 0) return 1; else return n * fact(n-1); } fact(1) static int fact(int n) { if (n == 0) return 1; else return n * fact(n-1); } 1 Data Structure and Algorithm 17 n=3 environment n=2 environment fact(3) static int fact(int n) { if (n == 0) return 1; else return n * fact(n-1); } fact(2) static int fact(int n) { if (n == 0) return 1; else return n * fact(n-1); } Data Structure and Algorithm 18 n=3 environment n=2 environment fact(3) static int fact(int n) { if (n == 0) return 1; else return n * fact(n-1); } fact(2) static int fact(int n) { if (n == 0) return 1; else return n * fact(n-1); } Data Structure and Algorithm 19 n=3 environment fact(3) static int fact(int n) { if (n == 0) return 1; else return n * fact(n-1); } Data Structure and Algorithm 20 n=3 environment fact(3) static int fact(int n) { if (n == 0) return 1; else return n * fact(n-1); } public class Factorial { public static int fact(int n) { if (n == 0) return 1; else return n * fact(n-1); } public static void main(String[] args) { System.out.println(fact(3)); } } % java Factorial Data Structure and Algorithm 21 ... Addison-Wesley • Cấu trúc liệu giải thuật, Đinh Mạnh Tường • Giải thuật lập trình, Lê Minh Hoàng, Đại Học Sư Phạm, 2002 Data Structure and Algorithm Recursive Factorial Tính giai thừa, dùng đệ qui pubic... and Kevin Wayne, edit by Dao Nam Anh Major Reference: • Robert Sedgewick, and Kevin Wayne, “Algorithms” Princeton University, 2011, Addison Wesley • Algorithm in C (Parts 1-5 Bundle)- Third Edition