Discrete Structures20815 marksProving Correctness of Recursive Algorithms
Define subset and power set. How do you prove correctness of recursive algorithm using Induction? Illustrate with an example.
Define subset and power set. How do you prove correctness of recursive algorithm using Induction? Illustrate with an example. [5]
--- A set A is called a subset of set B if every element of A is also an element of B. This is denoted as: A ⊆ B if and only if ∀x (x ∈ A → x ∈ B) Example: If A = {a, b} and B = {a, b, c}, then A ⊆ B. - The empty set (∅) is a subset of every set. - Every set is a subset of itself. --- The power s...