1 / 29

Recursion

Recursion. What Does this Program Do?. void func(){ char c; c = getchar(); if (c == '<br>') return ; func(); putchar(c); { int main(){ func(); return 0; {. live. What Does this Program Do?. void func(){ char c; c = getchar(); if (c == '<br>') return ; func();

adair
Download Presentation

Recursion

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Recursion

  2. What Does this Program Do? void func(){ char c; c = getchar(); if (c == '\n') return; func(); putchar(c); { int main(){ func(); return 0; {

  3. live What Does this Program Do? void func(){ char c; c = getchar(); if (c == '\n') return; func(); putchar(c); { int main(){ func(); return 0; { Input: func c = ‘l’

  4. live What Does this Program Do? void func(){ char c; c = getchar(); if (c == '\n') return; func(); putchar(c); { int main(){ func(); return 0; { Input: func c = ‘i’ func c = ‘l’

  5. live What Does this Program Do? void func(){ char c; c = getchar(); if (c == '\n') return; func(); putchar(c); { int main(){ func(); return 0; { Input: func c = ‘v’ func c = ‘i’ func c = ‘l’

  6. live What Does this Program Do? void func(){ char c; c = getchar(); if (c == '\n') return; func(); putchar(c); { int main(){ func(); return 0; { Input: func c = ‘v’ func c = ‘i’ func c = ‘l’ func c = ‘e’

  7. live e What Does this Program Do? void func(){ char c; c = getchar(); if (c == '\n') return; func(); putchar(c); { int main(){ func(); return 0; { Input: func c = ‘\n’ func c = ‘v’ func c = ‘i’ func c = ‘l’ func c = ‘e’

  8. live ev What Does this Program Do? void func(){ char c; c = getchar(); if (c == '\n') return; func(); putchar(c); { int main(){ func(); return 0; { Input: func c = ‘\n’ func c = ‘v’ func c = ‘i’ func c = ‘l’ func c = ‘e’

  9. live evi What Does this Program Do? void func(){ char c; c = getchar(); if (c == '\n') return; func(); putchar(c); { int main(){ func(); return 0; { Input: func c = ‘\n’ func c = ‘v’ func c = ‘i’ func c = ‘l’ func c = ‘e’

  10. live evil What Does this Program Do? void func(){ char c; c = getchar(); if (c == '\n') return; func(); putchar(c); { int main(){ func(); return 0; { Input: func c = ‘\n’ func c = ‘v’ func c = ‘i’ func c = ‘l’ func c = ‘e’

  11. The Three Rules of Recursion • Base (termination) condition • Decomposition to smaller instances • Use solutions to smaller instances to solve the original problem

  12. Reverse Print void reverse_print(){ char c; c = getchar(); if (c == '\n') return; func(); putchar(c); { int main(){ func(); return 0; { Recursive Call

  13. Exercise • Write a program that receives an integer and returns its sum of digits. • We do not know the number of digits in advance. • Example: the sum of digits of 369 is 18.

  14. GCD – Greatest Common Divisor • Definition: For two or more non-zero integers, The GCD is the largest positive integer that divides both numbers without a remainder. Examples: GCD(12, 8) = 4 GCD(12, 4) = 4 GCD(12, 5) = 1

  15. GCD – Euclid’s Algorithm GCD(616, 143) ? 616 % 143 = 44  GCD(143, 44) 143 % 44 = 11  GCD(44, 11) 44 % 11 = 0  11

  16. GCD - Code int main() { int num1, num2, div; printf("Enter two positive numbers: "); scanf("%d %d", &num1, &num2); div = gcd(num1, num2); printf(“the GCD is %d\n", div); return 0; } #include<stdio.h> int gcd(int m, int n) { if (m == 0) return n; if (n == 0) return m; return gcd(n, m % n); }

  17. Fast Power Calculation • xy= x*x*…*x • Recursive definitions (assume non-negative y): 1, y = 0xy= x*xy-1, y odd (xy/2)2, y even y times

  18. Fast Power - Code int rec_power(int x, int y) { int tmp; if (y == 0) return 1; if (y % 2 != 0) return x * rec_power(x, y - 1); else { tmp = rec_power(x, y / 2); return tmp*tmp; } }

  19. Fast Power - Run rec_power(2, 5) rec_power(2, 5) x = 2, y = 5 return 2 * rec_power x = 2, y = 4 returnrec_power ^2 x = 2, y = 2 returnrec_power ^2 x = 2, y = 1 return 2* rec_power x = 2, y = 0 return 1;

  20. Binomial Coefficient = • Definition 1: The coefficient of xk in the expansion of the binomial power (1 + x)n. • Definition 2: The number of ways that k elements can be "chosen" from the set {1, 2, 3, …, n}.

  21. Binomial Coefficient • Think recursion: • If the nth element is selected – there are k-1 elements to choose from {1, …, n-1}. • If the nth element is not selected – there are k elements to choose from {1, …, n-1}.

  22. Binomial Coefficient Recursive formula: Termination Criteria: k > n  0 k = 0  1 k == n  1

  23. Binomial Coefficient – from Formula to Code int binomial_coef(int n, int k) { // termination criteria if ((k == 0) || (n == k)) return 1; if (n < k) return 0; return binomial_coef(n-1, k-1) + binomial_coef(n-1, k); }

  24. Binomial Coefficient – Recursion Tree n = 4 k = 2 int main() { binomial_coef(4, 2); return 0; } n = 3 k = 2 n = 3 k = 1 n = 2 k = 2 n = 2 k = 1 n = 2 k = 0 n = 2 k = 1 n = 1 k = 1 n = 1 k = 0 n = 1 k = 1 n = 1 k = 0 n = 0 k = 0 n = 0 k = 1 n = 0 k = 0 n = 0 k = 1

  25. Reverse digits • Receive an Integer number, reverse the order of its digits • We already wrote the iterative version. How can we solve it recursively?

  26. Reverse Digits • Example: reverse_digits(573824) • Wishful Thinking: If I only knew reverse_digits(73824)… • Problem – for a number with d digits, the last digit should be multiplied by 10d. But how can I know d in advance? • Solution – Call a helper function that diffuses the temporal result throughout the recursion. - What is the termination criterion?

  27. Reverse Digits - Code int main() { int num; printf("Insert an integer\n"); scanf("%d", &num); printf("%d\n", reverse_digits(num)); return 0; } int helper(int n, int res) { if (n == 0) return res; return helper(n/10, 10*res + n%10); } int reverse_digits(int num) { return helper(num, 0); }

  28. Sum Digits - Solution int sum_digits(int num)} if (num < 10) return num; return sum_digits (num/10) + num%10; { int main(){ int num = 0, sum = 0; printf("Insert an integer\n"); scanf("%d", &num); sum = sum_digits(num); printf("%d sum of digits is %d\n", num, sum); return 0; {

More Related