Assignments Algorithme Cs3h0l Name : CSukainn & hein -S class: CSE-A Rll No: 46 my No: 4635 23/0 #1] Si ae a ee aee eee Auiobsle the elements a ari in aKcending order | elements ove tiven Areap orks She BV BY 4, 1,1) thy Sh) Write dhe Lime Complexity: dlept> Slot by building a array Ma» Aap trom Phe given Anvral array; 91; 99, TM Wy th, By, va] oe @ Sp®? Fnsex 4, W te smaller than #). Ao Atop. | él BY, aS LPF Enso) eg are Placed in the deft Aubtree BG the root node. MB) Go Gd) Sepa: Freee it. 4 4, fasertee! at the inst position 4 the Aast node. the next position. 66) (31) @) OO my 16 Is ineented. Se doesntl orele properly Bo uswap the exact peeiHon.- do @ Dé @ hep? Then the value sy is insotted dt Aatioties the heap orden Property Stepe: Tnsent Je doesnot satisfy the heap order prerenty Dhen Swap the vale ag. foe @ Pa eee ) © Gs) eae Bre Complenitys leat 4. aoe the mon- heaps This bakes Otn) time, euhere n is Efe no of elements in the arcay . Exctroching elements 4 heapbying: This takes O(n fogn) because fer each of pee n- elements, perform a heap) ty operation which takes 6 (beg) time+ Time _Complanity :o(n lean) Wwe Sa at tne first position of the dpstnede-g: Sort the following elemenls nein BO, '0 18} HO, 380,02, ON) 1B. Ingention Bort bvorte the tyme Corp len Slept: Compare the first two elements ancl swap the appropriate order, | Solto | 7 o| 20 Ss ¢ s|4 a2 iH to] 50 6 | He Bol Q@} 4 [ls “Stepa: Compare the first dhree elements and already in arranged orden (0 | 50/76 /yHo| 30 la b | them: [00 HO 50 |7e 30/2 be LS [ co [ae no] 50 Tela} y eal Sep? Compare first sive elements +The @ is wepped to the Mt focation. [2 [ie 30 }40| 50 |7e] 4 IS Sbepb: Compose fixst even Awepped to the 974 oe cation. swap be theiy appropriate posttron. They ove | Steps: Compare te fist four elements and swap Step Compare the first fve elements. The elemet Bo !4 Awapped to the second posrton. element elements anal 4» Isa bext T= 31mie P=26 WIth raredulo 2 Using the Rabin- karp algorithm for 426536897193. Find the pattern Z=13 Weite the Lme Compleatity: | Givens “ext T= 314159 94 5358 4793 | Pa tern P=Qb Poime rAXroctuloe q2'3 Steps: caleadeate Lhe pattern hash P | Poller P2286 has fength m=a Compute hesh p fer p using: pattern has= 26 mod 1350 pattern harh po Stepa: Hirst Substring: 31 Hash functtm: 21 mel (23-5 40 Shit) from it and take the next bwo Values: PS? e sendl Bubs loing 11 hash Siretion tnt med = pasa fe BhYt geom kt and fake the next fwo vo lues-Sdeput Thind substy ing 649 Tee Slash ‘functien :69 mod 1347 xO Shift sbrom it and doke the nexe bwo tri gs. Steppe: Fourth Bubstring : a4 Flash furction: 26 med 13-6 Tivect Comparison: Substring 26 a pattern 26 7 Match founel. ee Fotptm) , whieh csimp lhies to ofr) gor Tye n- dy Apply kMP algorithm fer the ext T= ABAABCABAAER | BAe Aeund or fime Comp Cones toy . Gtiven: Teel 7? ABAABCA BAAB AGRE pattern ABRABA ABA tUstte the Petlern P: PBA pBABA ) Peng th mre Btept! Construct porepix table. °o It 2 3 ot & é 7 A Ss A A B A 4 |A e je tt [> }3 fa fs ]lé | Sepa: grork matching search for pattern bext with the heap SL prefix bable. O41 fo: sk & ett Ato it 12 13 14 Alelalalelelalela lalelb felfale] vlelel oe 7 i)== Aurion Ja |» a Ja Pl PY ' - | ee yen eye bigg eee eae fA pattern £& [lent inetex af ware tched - character) — _ Cfinegin- table [pattern index) => Bo pine fir table [oT = G-0 b w Shih pattern Start eg at Index 5- Step 3 gg eg ce) de Ne ea “|| ae 4 Bf ala . | | | we ee | Wiismateh caused ab pinst, Bo Shift to rot Unelen, Shift pattern Skat al indexeé. bepy! jafefe A | eile ao Alela Bale | [eet [eae oe | eee ae lee ea fatein feunel . lasting at index € in te Time Complercity : ¥ Perepie table Conetruetion :o¢m) ¥ [Pattern Asearch soln) ¥ Overall Ltme Complexity 2 OCnrm)