MIT麻省理工学院 算法导论公开课Problem Set 1
- 格式:pdf
- 大小:51.49 KB
- 文档页数:3
IntroductiontoAlgorithmsSeptember7,2005MassachusettsInstituteofTechnology6.046J/18.410JProfessorsErikD.DemaineandCharlesE.LeisersonHandout52Handout5:ProblemSet1
(a)
(b)
(c)
(d)and(notethelittle-)
(e)and
Problem1-2.Recurrences
Giveasymptoticupperandlowerboundsforineachofthefollowingrecurrences.Assumethatisconstantfor.Makeyourboundsastightaspossible,andjustifyyouranswers.
(a)
(b)
(c)
(d)Handout5:ProblemSet13
Figure1:Anexampleofaconvexpolygonrepresentedbythearray.isthevertexwiththeminimum-coordinate,andareorderedcounterclockwise.
(b)Giveanalgorithmtofindthevertexwiththemaximumcoordinateintime.
(c)Giveanalgorithmtofindthevertexwiththemaximumcoordinateintime.