1 / 22

Discrete Mathematics: Recursion

Discrete Mathematics: Recursion. Section Summary. Recursively Defined Functions Recursively Defined Sets and Structures Structural Induction Recursive Algorithms Factorial Exponentiation GCD Binary Search Merge Sort Proving Correctness of Recursive Algorithms.

shelly
Download Presentation

Discrete Mathematics: 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. Discrete Mathematics: Recursion

  2. Section Summary • Recursively Defined Functions • Recursively Defined Sets and Structures • Structural Induction • Recursive Algorithms • Factorial • Exponentiation • GCD • Binary Search • Merge Sort • Proving Correctness of Recursive Algorithms

  3. Recursively Defined Functions Definition: a recursive or inductive definitionof a function consists of two steps. • Basis Step: specify the initial value of the function. • Recursive Step: give a rule for finding its value at an integer from its values at smaller integers. Example: give a recursive definition of Solution:

  4. Recursively Defined Functions Example: suppose f is defined by f (0) = 3and f (n + 1) = 2 f (n) + 3 find f (1), f (2), f (3), f (4). Solution: • f (1) = 2f (0) + 3 = 2  3 + 3 = 9 • f (2) = 2f (1) + 3 = 2  9 + 3 = 21 • f (3) = 2f (2) + 3 = 2  21 + 3 = 45 • f (4) = 2f (3) + 3 = 2  45 + 3 = 93 Example: give a recursive definition of the factorial function n! Solution: for instance, 4! = 4  3  2  1 = 24 or we can say 4! = 4 3! f (0)= f (1) = 1 f (n + 1) = (n + 1)  f (n)

  5. Fibonacci Numbers Example : the Fibonacci numbers are defined as follows: f0 = 0, f1 = 1 fn = fn− 1 + fn− 2 Find f2 , f3 , f4 , f5 . • f2 = f1 + f0 = 1 + 0 = 1 • f3 = f2 + f1 = 1 + 1 = 2 • f4= f3 + f2 = 2 + 1 = 3 • f5= f4 + f3 = 3 + 2 = 5 Later, we use the Fibonacci numbers to model population growth of rabbits. This was an application described by Fibonacci.

  6. Recursively Defined Sets and Structures Example: subset of integers S Basis Step: 3 ∊S Recursive Step: if x∊S and y∊S, then “x + y” is in S • Initially 3 is in S, then 3 + 3 = 6, then 3 + 6 = 9, etc Example:the natural numbers N Basis Step: 0 ∊N Recursive Step: if n is in N, then “n + 1”is in N • Initially 0 is in S, then 0 + 1 = 1, then 1 + 1 = 2, etc.

  7. Strings Definition: the set Σ* of strings over the alphabet Σ • Basis Step: λ ∊Σ*(λ is the empty string) • Recursive Step: if w Σ*and x  Σ, thenwxΣ*. Example: if Σ = {0,1}, the strings in in Σ*are the set of all bit strings: λ, 0, 1, 00, 01, 10, 11, etc. Example: if Σ = {a,b}, show that aab is in Σ*. • Since λ ∊Σ*and a∊Σ, then a ∊Σ*. • Since a ∊Σ*and a∊Σ, then aa∊Σ*. • Since aa∊Σ*and b∊Σ, aab∊Σ*.

  8. String Concatenation and Length Definition: let Σ be a set of symbols and Σ* be the set of strings formed from the symbols in Σ. We can recursively define the concatenation of two stringsas follows: • Basis Step: If w Σ*, then w ∙ λ = w (empty string) • Recursive Step: If w1Σ* and w2Σ* and x Σ, then w ∙(w2x) = (w1 ∙ w2) x • If w1 = ab and w2 = cad, the concatenation w1 ∙w2 = abcad. String Length: the length of a string “w” can be recursively defined by: l(λ) = 0 and l(wx) = l(w) + 1 if w ∊Σ* and x∊Σ

  9. Well-Formed Formulae in Pro. Logic Definition: the set of well-formed formulaein propositional logic involving T, F, propositional variables, and operators from the set {¬, ∧, ∨, →, ↔} is defined by: • Basis Step:T, F, s are well-formed formulae, where “s”is a propositional variable. • Recursive Step: if E and F are well-formed formulae, then the following formulae are also well-formed: (¬ E) , (E ∧ F) ,(E ∨ F) , (E → F) , (E ↔ F) Examples: “((p∨q) → (q ∧ F))”is a well-formed formula but “pq∧” is not a well-formed formula.

  10. Recursively generating Rooted Trees and Full Binary Trees

  11. Structural Induction Definition: to prove a property of the elements of a recursively defined set, we use structural inductionas follows: • Basis Step: show that the result holds for all elements specified in the basis step of the recursive definition. • Recursive Step: show that if the statement is true for every elements used to construct new elements according to the recursive definition of the set, the result holds for these new elements. • The validity of structural induction can be shown to follow from the principle of mathematical induction.

  12. Induction and Recursively Defined Sets Example: S is defined as follows (3 ∊S) and (if x∊S ∧y ∊S then x + yS), show that it is the set of all that are multiples of 3. Solution: let A be the set of all  divisible by 3. To prove A = S, show that: • Mathematical InductionA ⊂ S: let P(n) be “3n belongs to S”. • Basis Step: 31 = 3 ∊S, by the first part of the recursive definition. • Inductive Step: assume P(k) is true, i.e., 3k ∊S. So, 3 ∊S and 3k ∊S, then 3k + 3=3(k + 1) ∊S. Hence, P(k + 1) is true. • Structural InductionS ⊂ A: • Basis Step: 3 ∊S. Since 33, it also belongs to A. • Inductive Step: we must show that if x∊ A and y∊ A, then x + y must be also in A. If x and y are both in A, then 3x and 3y. By part (i) of Theorem 1 of Section 4.1, 3(x + y), therefore, x + y∊ A.

  13. Recursive Algorithms Definition: an algorithm is called recursive if it solves a problem by reducing it to an instance of the same problem with smaller input. • For the algorithm to terminate, the instance of the problem must eventually be reduced to some initial case for which the solution is known. • We will review the following recursive algorithms: • Factorial • Exponentiation • GCD • Binary Search • Merge Sort

  14. Recursive Factorial Algorithm Example: give a recursive algorithm for computing n!, where n is a nonnegative integer. • Solution: use the recursive definition of the factorial function. • 3! = 3 2! 1! = 1  0! = 1  1 = 1 • 2! = 2 1! 2! = 2  1! = 2  1 = 2 • 1! = 1  0! Initial Case 0! = 1 3! = 3  2! = 3  2 = 6 • procedurefactorial(n:nonnegative integer) • if n = 0then return 1 • else return n factorial(n − 1)

  15. Recursive Exponentiation Algorithm Example: give a recursive algorithm for computing an, i.e., exponentiation, where a is a nonzero real number and n is a nonnegative integer. Solution: use the recursive definition of an. 43 = 4 42 42= 4 41 41= 4 40 Initial Case = 1 ... Then backward substitution. • procedurepower(a:nonzeroreal number, n:nonnegative integer) • if n = 0then return 1 • else return a  power(a, n − 1)

  16. Recursive GCD Algorithm Example: give a recursive algorithm for computing the greatest common divisor of two nonnegative integersa and b with a < b. Solution: use the reduction gcd(a,b) = gcd(bmoda, a) and the condition gcd(0,b) = b when b > 0. • proceduregcd(a,b:nonnegative integers with a < b) • if a = 0then return b • else return gcd(bmod a, a)

  17. Recursive Modular Exponentiation Example: devise a a recursive algorithm for computing bnmod m where b, n, m areintegers with m≥ 2, n≥ 0, and1≤b ≤ m. Solution: • procedurempower(b,m,n:integers with b > 0 and m≥ 2, n≥ 0) • if n = 0then • return 1 • else if nis even then • return mpower(b,n/2,m)2 mod m • else • return (mpower(b,⌊n/2⌋,m)2 mod m  b mod m) mod m

  18. Recursive Binary Search Algorithm Example: construct a recursive version of the binary search. Solution: assume we have a1, a2, …, an, an increasing sequence of integers. Initially i is 1 and j is n. We are searching for x. • procedurebinary search(i, j, x : integers, 1≤i≤ j ≤n) • m := ⌊(i + j)/2⌋ • if x = amthen • return m • else if (x < am and i < m)then • return binary search(i , m−1 , x) • else if (x > am and j >m)then • return binary search(m+1 , j , x) • else return 0

  19. Merge Sort • Merge Sortworks by iteratively splitting a list into two sublists of equal length until each sublist has one element. • At each step of the second phase, a pair of sublists is successively merged into a list with the elements in increasing order. • The process ends when all the sublists have been merged. The complexity of the algorithm is O(n log n).

  20. Recursive Merge Sort • proceduremergesort(L = a1, a2,…,an) • if n > 1then • m := ⌊n/2⌋ • L1:= a1, a2,…,am • L2:= am+1, am+2,…,an • L:= merge(mergesort(L1), mergesort(L2)) • proceduremerge(L1, L2:sorted lists) • L := empty list • while (L1 and L2 are both nonempty) • remove smaller of first elements of L1 and L2 from its list; put at the right end of L • if this removal makes one list empty then remove all elements from the other list and append them to L • return L

  21. Merging Two Lists Complexity of Merge: two sorted lists with m elements and n elements can be merged into a sorted list using no more than m+ n−1 comparisons Example: merge the two lists 2, 3, 5, 6 and 1, 4.

  22. Proving Correctness of Recursive Algorithms • Both mathematicaland str0ng induction are useful techniques to show that recursive algorithms always produce the correct output. Example: prove that the algorithm for computing the powers of real numbers is correct. Solution: Basis Step: a0 =1 for every nonzero a  R, and power(a,0) = 1. Inductive Step: the inductive hypothesis is power(a,k)=ak, for all a≠0. Therefore, the algorithm correctly computes ak+1, since power(a,k+1) = a power(a,k) = a ak = ak+1 • procedurepower(a:nonzeroreal number, n:nonnegative integer) • if n = 0then return 1 • else return a power(a, n − 1)

More Related