Question

shull gay a) Which sorting algorithm behaves as insertion sort in one of its iteration. Explain it with an example (4) ) Lot fin) - 3n+8 and g(n) = n. Claim: f(n) = O(g(n)). Check whether selection sort is stable or not loso egin

pls answer explaining all steps

Answer 1

b) Let f(n) = 3n+8 and ginn f(n) = 3n+8, g(n)=n c.gens > flo) no We have to prove f(n) = 0/9 (n) It happens only if fon)<cgon), C30, 12 no, no Take f(n) = 3n+8. 3n+ 2 con At c = 4 3n+8 L cn, where n38 (0oJ (76) 0

9 giver optimal-worst Into Sost Algorithm Case peofoomance After every iteration in the input a that the number of elements needs to checked reduces So, after certain input, introscot algooithm behaves as e insertion Soot in one of its iteration C) Selection Soot is not stable Ex! If we have duplicales in ous data then the duplicated ave not in the same oods when the sooting is completed Completed) Composed coith initial order

Take 63 624 6,3 6₂4 2 Sin 326, swap 6 6 6 4 no charge 6/6/62 / 0 no change ist position is in coosect place. i) [3 1904 1 no change Blololel sump sine 446 Now tativo 3d position, no change! At first 61, 62 is the codes but after Sooting 62,61 is the oddes.