linik fs Iniseduction te O50 Sthuckines aace fey ; aiteenatic wae te @yganiee clata aude it of cently mi of date g Interface An @rder to — Foundation undation 4 Shuck tosis dota +f } Athuclunt supports | faxameters Hey om get of opeaatuens thot a data re Lut a supported operstions bp 9, accept -f¥ seturn tie of operat ons 2] Amplementation ; provides internal acpicsertation o dota. Fe. definition of algodithr ured in operations Algorithms kn algorithm cy a well Aefined , finite ace @eny Bequited sesult. Propeattest- Input O or mere value Qutpuk + AE dost 4 vatuc Definiteness i stip -by- step procedure fo fed Sot AF each tnt 41 prectge PR unambiguous. ‘Fniteness- ehoutel terminate aftr A no. of steps Effectiveness: every instr should Le Laric enough Paeuslocode ~ description of an algoxithn (Sructwted than usual prose but leis forme! than Pragvanming Lang ) 21> Algowitrm- ArrayHam (fn) Thpars- am array A ering hm Inkeg at Output ¢- Mandmnurn element ir A 4. dorgur <— Alo] 2. foriet & m4 do 21 cf forget < ALi] Hun Deed dorgut< ALi 3. Aeturn Largest” 991x elittract Datatypes. (aot) $n COP, dala 4 operations that manipula that data are grouped an da- (ADT) 6% data structures 64 collections Stove dolm -f atlour various aperitions on data to access and Drange ak. bhy Abstract 9 Specify tre operation a data stouctors Cinterpace) 4 leave implementation lchails to later “4 Bage PR Gey. Cant) Bag te Add, semove ,access Ftems no implied eden to. items | duplicate allowed. Let t= mo duplicates allowed i union , Anterterton , dibhasne , Subset | ~ x Algorithre Comm plenty | appose X 4s an _algeritnm Pon ts He) size ef Anput data, Be time fh space used by algoritem X are anain faders, which clecicles offi ciency af x. “Time factor - “fine 4 measured by counting He ng. of key operations . Ceompanrisons tn Sorking algorithms). | + Bpace factor - Measured! by counting maximum Space » memory Begured by algertinn | | “fine — Comapleaci'ty.. | * &eecutton firme physically clocked eq alge sum O SOL {sun 10 nth (chedbing the Apurcast, where condition * ad “2 Total = 2043,Asymplotic — dnatysis oes te computing’ te inte ‘ a “” "3 any epeation in mathematical ay oP. Ki) eg Em a ete Iw con cendude Berk woe Aue, ug” case fe woot case gy algouthm ey F Searching elements a an arday. (41% element | Aast element [otterctt Notations “- 0 (Wert cate) Wotatzsn (Upper bord) “(Best cose) Netation — (lower bound) 6 Rotation TO Notation ee ebovnel ) > fin0 and no such thar Fln)no ¥ Worst case complenity Or tre lengesr dime gan Algerth can -possioly take bo Complete. no oot ee Na 2 Notation (Lown bound) tn) Beak case compleni ty x —— gin) the bee amount of dime an alg erithmn oon pozsibly tals to i o Complete. o Pln)= ag(ny) | —_ — te -a(P(n))> J gird! thew enise COO And Me sud> Hat GMseFr) f4 all n> no % ror3] O Notation ame Order) | | tg tn? —/ 2) | — eygtn) n 6 Rn) = (G0) 8 (Am = 4g tm) af and amly of 90m) = oeln)) and gi) = 26 ln) Jor abt_n>no- 4 “the Woration Oi the formal _osary $0 emprest both Awe a : o's teunning Finne oer fh upper bourd ef an algertibm's * ten Hime Bast cose analysis t- on “ideal” unpub Wensh couse analysts _3-_ om __weask input sec - cose analysts f= en_awg euteone of Stunning algo ever sandem —unput bors b cane Ems Bens q : ous) cone ‘ms Best case + Bevis -f- Conquer Divide $- Divicke input dgla S into 2or more clisjoint| -substls Ree n $- Salyre stat Sab Aablen Hecur sively. _|_ Conquer - Combine solutions for subssets ico! . nto solution $0 OT | tye base case for Heumsion aru sch panics at contant 8 ea - Searching a Dictionary = ,Bart hacking — : - % & 4 ech *e Utest te setye problems with a Laroe ace yb iu -, Apec J ifrematicatiy Buying - eLininateng pouibiite,. “> dng trXocah & maze (Buying nese possible option chile 4 loack at “Stastny goin” af chee “Heart wee eptiont) Diegramn 5 Ruynam« Qromin: "S$ dimilax to divrde p conquer tn breaking the prover inte eration fe ger Grates possible Sub-pSoblems , but Hess Sub- problems are nol Solved Trdependenty. Perua of Smatiey Sub-preltems are ased for Strnflos overlapping 8ub -p, Adlclemy. ~ tas tep-down [bottom-up Approac, d Jeet Feforing to Previa tolutcon output iy cheaper than seccompulcny Uo fermi of Coy cycles « Y- Hloonacci series , Knopsack pAoblem, Towes ef Hanoi, BU Jpata Shewieat “path by Hoyd-Wanshalt Shorter path ty Dijkstea , Project Schectubarg