Scribd
Upload
7 views

(Lecture 1) Introduction Counting Sort Insertion Sort

python dsa

Uploaded by

ajisan2330152
Copyright
© © All Rights Reserved
Available Formats
Download as PDF or read online on Scribd
7 views

(Lecture 1) Introduction Counting Sort Insertion Sort

python dsa

Uploaded by

ajisan2330152
Copyright
© © All Rights Reserved
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 7
Date structures: A porticulay Way of oxganiai go thal it can be used affactively. ng dada ine Computer For sample: inter data nape pepe ey We can stork o list of stems having the same data- Ayre using the arvoy data strucsure - viffecent Deda sHructures = Linears arrays, Vists = Trees Binesy, heaps, space partition’ ng. etc ~ stone — Files — Queue ~ Records — Graph (ous of Data Structuras fen data struduns ~ Operating System = Array — Compiler design = Linked wry © Artificial Indulgence — braphics Sewmm data types “Tatigir, Floating wink, character, string » Boolean t " mo 10 -20 10.0 -2OS ‘A bh’ Rakim’ 123 -¥e0d No Whed ic algorithms 2 [pigecithen Representehon step by Step problem ° — Pseufdocodtpy Input a, b selution technique — Flechert mate — Program output sun | Scanned with CamScanner Array Data structure fs 71 0 1 | eb | 0 1 L ascndi “y oyd ev data ov alemenl Sader oy subs orig pescendt ng ordey “ce x Name} Abu [eee | Robi Nona Tncreas ing ord iv ° RK \ Lu a7 e- Alphabatical order Tt 3 el? [> | & Hine Sn esing ord ae crunk types of Sorting Techni ves phen {os = Bubble Sot — Selection Sart = Merge Sort % — Inser Hon sok * — Quin sorf * Different Cases of — Heap Soxt ® sarting: ( Sov es ascind ing wits) Bash cases plelazenl 3 = Counting svt ® Vinee’ — Rodin sort * 7 a aot a — Bucuet Sor Horh Cases A sein [oT [2] oot} Aversye Cases A Le [> [22] 20 o ol Lu Scanned with CamScanner Ans: Find Max numbers k Initialize Mapping Avvay count number stoved in Avvay A: find Proper Mapping Array o [ofe fo fea | tage c Auray A in tscending orvdev using counting sev EERE 3 2 output 12 9 AEk See c[e 4 za 2 o 4 S26 ALGO eLO=1 6f-OggT] of 2 3 4 of4]s fa Te] = 3 4 23 56 | <€9=°.[o o |sfa{e]) o 2 jz =| = 2 OG Se MI® C6 OORT TT TTA ees Taps) 1234 rR 424 A[al-@ D=% efd-@ ga] [a] 0 = pets ol 5 re ‘ } 34 joa ACSI false AND — | eener 7 > j ay=i ano ALVA "3 true AND ly 4 =true * rp True vor a4 a7=4 AND ALIA 2) True AND b= Te A “ wa \ ime False. : t4t= o+1=4 4 syed AND ALS DF | > True AND 1073, 2 True sate], Tre} TUL I= 2y=4 AND AL2) 77 aa Ste AND £77,= cralse*| 4[ 5] 3 [10] False 234 itlert=9 Scanned with CamScanner ovithm wor, Mae Fh Mages for y= ton Fee ate c ae : a wor aa ca t= aL] eee mek’ 1s 133 RS et a « 5 _— : - sant Las while (Giy=d) anv (AL'S >t) ye Ls ALity) = AL's te4 a . Le: tei-t while (1G DL . ena while ZA suns sum tly tottt Fl uy) ua: apiaijet ae + WY end fee ime Complexity Analysis — Best Case Anal ysts$ ali [zo [3e4 T 23 Line Number Iteration Time Ttration Time (n-th e qn ut toe ' 1 True False LZ n=l a a(n!) Le n-\ G3 é3(n-1) LA n-' eu ey (n-) is x x Le x % m “7 n-t 63 (9-9) ee otal twaniing dime, Tse cinta (n-D AOC) ta(n-) + Cy (no1 eitare4 cqtcyna (oy QM cy) = Ant B= Ow Scanned with CamScanner Worst Cose Analysts a[elzelie 1 jz2 ts20 yeu meek ye och) Wy Jep tew var wee a 3 times / / peo false) J HS Line Number Thoation. time] thevation Time 12 Q-2ayetan 4 en “True FalSe 2 n-) a atm) L3 n-1 eS) ce) no nye + LA Zils cy a a jz2 | jen n . n BUD ge BD jer Jer Naas n i Gd % « Se » je a [ n-t Gg éq(n- 5) ital running Hime, Tn) = ant G(n-i)FG(n-)4% 2) +6 SU i-)+ % 4 Grab (-) jer = Gynt nia Des pepeenQesret®) 4 og (1t2te +A) +% (retore +7) + elo) - eqns elerd rol aA ta (FEB —1) tes BUND +c, AE n=) 4 ¢9(n- ‘) Scanned with CamScanner é x t abe = nt oln-\)+ es(n-+ fy fain) _ nin) poe ue +e, MED 4 (nD | = n+ Gn-GtGn-Gty for Le mM aw cu os € r z Any+ BH tC = O(0) iW Average CSE Analysts condition © Ling Numbey — La L2 3 tA Ls u¢ 7 etal sunning ca + i) wy (a+ ate+ = +O fay Ano cy + + Cgn-¢ z7t t 7 (= by Cy ) ——— best 4 Worst Aen ‘ = — € while lop = x < Tteatin Time thaehen Tine esos n ey n-) Gq n-l cS) 3 its cA aE Jar n . Slab ts - a jee = iad ¢ Sik 6 J=h z (n-) Cy aT) Dawe om) Scanned with CamScanner

You might also like