Programming in Python - L85: Warm up for binary search | obvious search & time complexity

Welcome to Lecture 85 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 implement the simple obvious search method to find an element in a list using Python. We walk through the code test its functionality and measure its execution time using Python’s built in tools. This demonstration highlights the limitations of linear searching especially for large lists and prepares the ground for more efficient algorithms like binary search which we will study next. Along the way we also cover a few useful Python tricks including creating lists with range() importing user defined modules and using the help function. 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 #Python #SearchAlgorithm #ListSearch #ObviousSearch #TimeComplexity #CodingTutorial #PythonForBeginners #LinearSearch #Efficiency #IPython #PythonProgramming #AlgorithmAnalysis #CodingExample #PythonTimeModule #LearnPython #CodeWithPython