ak Aaa 2 An orth & dfned os Pete Aequnek = of tnanpbt queue Gastviitions followed to accomplish basctiudar task. OR— Choxactnistes of ~ Algorithen ‘ 3. Input: An olgovithmn must take some ‘fp. Tk can take x0 or more ‘/Ps 2. Outbut + An algorithm must gureiabs atleast ne ole. 3. Neffeitines 3 Evo Stotiment must be roma quous . Re, clean and sty stop “at a pasntfudax pefat s. Effediveners « “The statements weitlen should sue some puxbom $£ Should be ‘ae alght forcand® Alt covvedtnun thost vaca & hr CO) Time often : how fast Hee suns (8) Spauw effiteney : a rahe — memory We ume » Leding an Augie # The coding / implimentation of an alaettim t done brog xan Gs , Tava ‘ Tac an ala let = ena % 4 Worss, Best pnp Avernge cast Kericiency ¢ The inne Lomburity of some algettana dupinps on Sue of tr. But on acde cor, Hi “A wot true a Th toe 0f, Aearubtng algottions He Heme depends on the fosttten of © client te be seachesl TH the chet 4 found tm frat poatten of the dot “dnalf Hour Hae takin by abgor*thyn vit be bp. wd Thun, for same Y/e sta 'y the MEE dik (2) Went - cau (4) Bat - am () Acowage e W car 4 tiaWorst, Best ann Avernge CASe_ Rreicieney $1 | ___— Le A Aime. om be ages dapenbs on Su |E ‘4jr_. But tn so i wot tue. FE - Ty (oe of auasulog of oittlann the Hmne depends ge on the _posttten. of * tobe Seatlreoh TH the ehment found fe Secs _besi Hen. as zc tee dest “trl Hum Hon takin oO a E be bs. Z Ee Thus, fr sane Ye she 'm' , the Hime wethiatly diffe. So, detdid tmto 3 catignifes ¢ (0) WWosst - came fice (8) Best - caw fpeteney (i) Hone - cane ffiteng. | ckE TA EF(8) Worst - care fffeen The offietrey of olgoitien Aer yyotnt wore, apts. ‘for sohich cht takis “longut thu" fy exeut % fled wt fing 45 dn Minaan pare of bi pousrt to last portton. Cusorst (11) = Cb) Bet - caw epider _ “The Nap algorityns for but care fe Utne in? ch Him tab fer se tohe “ast Bae fo exert. & vs gre position. leat n) = a Averag ep fry = Ti eal Life ptlucitions, we tom aus wot - eon ae ves “indo 4. ae ann = distr? buted po ae “WAL ge hy mi avg: aw He. e fave (n). e rela)Agvmeroric Notations : “Tree a used to difine Hla suurirg Howe af on algortthen. Ww 4) 6 wtotalton 1 fora given func. 42 we dinot “4 alae) q | “ oCatn)) ={P(n) + thew axiste 4ve constants Cr, C2 and Mo _ such thot OL eign) 2 14) Lengin) for oll 92M 4 A_func. fl) belongs to sot 0 (4(w)) , 9f Huu exists +Ve wonstants Gand 62 such that can be “sandwiches” bho G4tn) _¢ crate) 410) 2 @ 9) soot 8) O- notation : for a qe func. qe we olinot A 2 Gon + O(gen)) = L#): Row ois sve constatts oo £ ny such thot 0< £0) £ dg(n)) for all n> moy We use 0" motation when thor & uppocbound of a func. fe. fh fn) boundid above. by Aome wnstanh mullip ke 44 )ton. “0Qo0). 3) 2 notation : br a gen ure. gb) dia ty PVs) gut: * (gem) * Lo): vw ente +ve constant ¢ ¢ Me eh Hat 0 60) = 269 ot fat arne f ke use 1 Q' motation when Hens tower. bound of ao tune, fe, Pf ffm) & bounducd _belovo oy sone constant amalitple sof — gin. i + 8's 2ul9t03) A) _bdu. +0" - notation + Th & aud + dno an ufpee- bound that & mot seg mpteFicatly Hight. “ofge)) = ft) : “¥ ave constant 00 neh that er ey) dn ott nirot 5) [tbls AL. motatton 1 Te eed to derwh ae Sowur- bound Hot & not asympte Heatly fight.pais \ ' “} 2G) « ff): Br oy +ve oes c>O sub that OS AM) < £(n) for Ol mono & FZ, | eiey ners a aerate ar)