COMP327数据结构与算法II测验1时间复杂度与分治算法分析.pdfVIP

COMP327(Fall2013)DataStructuresandAlgorithmsII

Quiz1.4:10-4:40pm,2ndOctober2013

Grader:JeppeThomsen,csjrthomsen@comp.polyu.edu.hk

Question1TimeComplexity,Divide-and-Conquer[56marks]

(a)Foreachrowbelow,compareT(n)withS(n)andtickthecorrectbox(es).[32marks]

[Note:youmaytickmultipleboxesinthesamerow.]

4marksperentry

T(n)S(n)IsT(n)=O(S(n))true?IsS(n)=O(T(n))true?

3n5n[√][√]

23

log(n)log(n)

59[√][√]

65n63n[][√]

32

(2n(9n[][√]

))

n

(b)Designadivide-and-conqueralgorithmtocomputethefunctionF(a,n)=a[24marks]

Completethefollowingalgorithm.Assumethata≥1andn≥0.

Pleasenotethat:

?

oYouarenotallowedtocallthefunction“power”/“pow”.Don’twriteainyoura