DSA-1 CO5 | Week 10 Lecture 3 | Part 1/6 | Sorting applications, bounded keys and synthesis

DSA-1 (26SC1203E) - revised two-weeks-per-CO sequence. CO5: teaching Weeks 9-10. Week 10, Lecture 3: Sorting applications, bounded keys and synthesis. Part 1 of 6; slides 1-3. Watch the numbered parts in order. Local SvaraCraft M1 narration, timed yellow/cyan annotations and English captions. Follow the guided pauses and write your own predictions, tests and reasoning. Student-lab solutions and private answer keys are excluded. Narration uses an AI-generated voice. Teaching materials: https://chaitanyakumar.in/dsa1 University SLM: https://y26btech.klef.in/slm/26SC1203... Original SLM week numbers identify source readings; the revised teaching plan governs delivery. Chapters 00:00 Slide 1 / Week 10 / Lecture 3 00:11 Slide 1 / Contract / state / invariant / cost 01:25 Slide 2 / One minute: safe comparison, stability, ranks and inversions 02:48 Slide 2 / Compare original indices with value order 04:11 Slide 2 / Safe comparison / input tie order / duplicates count 04:33 Slide 2 / Ordinary inversion: i less than j and a[i] greater than a[j] 07:51 Slide 3 / 3 before 30: 330 greater than 303 08:16 Slide 3 / 9 before 34 / 12 before 121 08:41 Slide 3 / Choose the larger of a+b and b+a 09:04 Slide 3 / Transitive string relation / equal need not mean identical