Homework 3
Alexander Gazarov
CS 608 Algorithms and Compu ng Theory
February 19, 2013
1. Come up with a divide and conquer algorithm. Use the template to describe and analyze the
algorithm.
Input: a and n
Output: ni=1 a
Algorithm:
a
+a+
cfw_z + a
n

a
+
CS608 Algorithms and Computing Theory
Homework 1
Mayur Nayak (UID: U01177266)
1. (
)
for n 1
Proof: Base step: If N = 1, then
=1
Inductive step: Assume (
Show (N+1) case (
(
)
(
)
)
(
=
=
=
=
2.
Proof: Base step: if n=0, then
Inductive step: Assume,