Sabancı University
Faculty of Engineering and Natural Sciences
CS301 – Algorithms
Homework 2
Due: October 20, 2009 (17:40  Recitation @ FENS G035)
PLEASE NOTE
:
•
Provide only the requested information and nothing more. Unreadable, unintelligible and
irrelevant answers will not be considered.
•
You can collaborate with your friends and discuss the solutions of the problems. However
you have to write down the solutions on your own.
•
Plagiarism will not be tolerated.
•
You don’t have to typeset your answers but feel free to do so if you want to.
•
Please hand in the hard copies of your answer sheets to TAs at the beginning of the recitation
hour on October 20, 2009.
Question 1)
Show that the following recurrence is
θ
(
n
2
lgn
) by using the substitution method.
T
(
n
) = 4
T
(
n/
2) +
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
This is the end of the preview.
Sign up
to
access the rest of the document.
 Spring '10
 .
 Algorithms, Englishlanguage films, @, Recurrence relation, Master Theorem, following recurrence, Sabanci University Faculty of Engineering and Natural Sciences

Click to edit the document details