Programming in Python - L80: Sorting recursively | recursive sorting algorithm explained

Welcome to Lecture 80 of the course "Programming in Python" by Prof. Sudarshan Iyengar. Full Course: https://study.iitm.ac.in/ds/course_pages/BSCS1002.html Video Overview In this lecture we learn how to sort a list using recursion through a step by step breakdown of a simple yet effective algorithm. We begin with the base case and build upon it by identifying the minimum element in the list placing it in the correct position and recursively sorting the remaining elements. The lecture also introduces the initial version of the mini function used to find the smallest element of an array. This session provides a clear introduction to recursive sorting and encourages coding along for practice. About IIT Madras' online Bachelor of Science programme IIT Madras offers four-year BS programmes that aim to provide quality education to all, irrespective of age, educational background, or location. The BS programme has multiple levels, which provide flexibility to students to exit at any of these levels. Depending on the courses completed and credits earned, the learner can receive a Foundation Certificate from IITM CODE (Centre for Outreach and Digital Education), Diploma(s) from IIT Madras, or BSc/BS Degrees from IIT Madras. For more details Visit: https://www.iitm.ac.in/academics/study-at-iitm/non-campus-bs-programmes #recursion #sorting #python #algorithms #tutorial #coding #programming #dataStructures #recursiveSorting #minimumElement #listSorting #pythonForBeginners #LearnPython #CodeWithPython #PythonCourse #ProgrammingConcepts