Please visit the Lesson Page for more detailed info
In this lesson, we learn and implement, binary search, one of the fundamental algorithms in computer science. Along the way, we also discuss a universal strategy for solving programming problems and gain an intuitive understanding of the complexity analysis.
Notebooks used in this lesson:
- Linear and Binary Search: https://jovian.ai/aakashns/python-binary-search
- Problem Solving Template: https://jovian.ai/aakashns/python-problem-solving-template
- Linked Lists in Python: https://jovian.ai/aakashns/python-classes-and-linked-lists
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!