Question

a) Devise a divide-and-conquer algorithm that determines whether the two candidates who received the most votes each received at least n/4 votes and, if so, determine who these two candidates are. [Hint: a candidate could not have received a semi-majority of votes in the overall election without receiving a semi-majority in the first half of votes or a semi-majority in the second half of votes (note: you need to defend this).] b) Use the master theorem to give a big-O estimate for the number of comparisons needed by the algorithm you devised in part (a)

Answer 1

Anosa divice and Conuen a) The obiecbire is to davise algsi thm totamine te majeity o votes ecie ved the most voty lach neciava at lest nvotes a SeQuence into. algaithn divides - Adiniele and- Conouen Same d moe Sub- CeQuenas reccs h slutisn tothe Subseauancas ae traxebte useal (sind the Solubion bo the digina/ Fintind the econenc2 9edation fot the oigial Ceduene stepi ther andate in seaence, the andi ntes ho naciaad the most vota Cach eciorad atiet voto Calicktes, 2n and rote b aracHy Assuna n is ew to, stape divide, the vote in foo cubeQuen length e Candicatadoei not qt maiotify voter incte of enly 2 sQuana then divide each Subaduenae precadane and chact Ga the maistiy usiny Sama

stepa Rapoat stepuobi re maidity 6o voles Gome Candish ker ith up hen nun torough the antixeQuone to Count the no dsvote fo aath candietate tobin the nne votesin the Seouence checl hethe ) Compre the t Godichte hai p that vole d not As tha saOUGDEO, is no od lompasisios longt ven le eouidEJ . Compapisions tota yCompaisins -) Sauena neOuiy . the Sub sSOuens -)conteduently the pos Companision used by the mege less han H) ohera Sort o So t npaople bhich HCn) is a burhon and sabsbiadte divide and nehfon and Conduaalgotithm. ad nearano Comploniy of agaithm minimi zed the Hen) HC)

3 buse Macter thasam to edmaka obtaine in obCompanisons pasta) abunction is incresSing necunonc e lation ob 6sm HCO) = at(%) teit c dan nal numberr bith c is tve The values then negabve Men) ib-arbol (wadu then value oa,b,c and dane tn ith HC))= QCO6}tcrd H o hene ar, a, b,c 1, d = 1 ben Corctfion a is not is not sa bsbed afebiaa

So hena Condition a<b is satisGied ten Hm-oCod) then H)DCn)