课件教程秋季327asgn1327.pdfVIP

COMP327(Fall2011)DataStructuresandAlgorithmsII

Assignment1

Note:RemembertowriteyournameandstudentIDonyourassignment.

Writtenpart:Questions1and2

-70%ofmarksinthisassignment

-Submitthehard-copyofyourassignmentinclass

th

-Deadline:15:30,on24October2011(Mondaylecturebeginning)

Programmingpart:Question3(i.e.,programmingforQuestion2)

-30%ofmarksinthisassignment

-Youcanonlysubmitonefile/program.PleasefollowthenamingruleinQ3.

-Submitthesoft-copyofyourprogramtoWebCT

-Deadline:23:59,on23rdOctober2011(Sundaynight)

Question1:DivideandConquer

n

ConsiderthefunctionF(a,n)=a,whereaanrepositiveintegers.

AsimplecalculationmethodforF(a,n)istoexecutemultiplicationsone-by-one:a*a*a*…*a.

However,thismethodtakesO(n)time.

WewanttocomputeF(a,n)efficientlybyapplyingdivide-and-conquer.

(a)[15marks]

Astudentdesignedthefollowingalgorithm.

intComputeF(inta,intn){

temp:=0;

if(n=0)

temp:=1;

elseif(n=1)

temp:=a;

else

temp:=ComputeF(a,n/2)*ComputeF(a,n/2);

returntemp;