Lesson 3 - Sorting Algorithms and Divide & Conquer

Please visit the Lesson Page for more detailed info :point_up:

:play_or_pause_button: Live Session Links:
English: https://youtu.be/M6NJUfT14aY
Hindi: https://youtu.be/W0R6m1sX1sY

Lecture Date and Time:
English: Add to Calendar (Google)
Hindi: Add to Calendar (Google)

:zap: In this lesson, we explore the sorting problem and apply the divide-and-conquer strategy to come up with efficient algorithms for sorting.

Notebooks used in this lesson:

:question: Asking/Answering Questions :
Reply on this thread to ask questions during and after the lecture. Before asking, scroll through the thread and check if your question (or a similar one) is already present. If yes, just like it. During the lecture, we’ll answer 8-10 questions with the most likes. The rest will be answered on the forum. If you see a question you know the answer to, please post your answer as a reply to that question. Let’s help each other learn!


Hi guys
how can someone test each individual code in a function to enable one understand it better

I am not sure if I got your question right, but I think you mean you want to test each line of a code of a function that you made? You can give a print statement and check what the above value prints and compare it with what it should print and you can do this for all confusing line in your code and later when you have removed all your confusion you can comment/remove the extra print statements.

Could someone explain how the second step is calculated please i.e.,