Linear Search in 2 min (Python)
In this video, I will explain linear search by demonstrating the algorithm in a program iteratively (using a for loop) and then recursively (using recursion).
The way linear search works is that you have a number that you want to search for in an array or a list. If it exists in the array, you return the location (which is the index) where that number occurs. We call this number "the target". If the target does not exist inside the array, you simply return -1.
What is recursion? Recursion is a function that calls upon itself. Here, we write a function that calls upon itself to linear search an element or value inside an array using a for loop and using recursion. While it is easy to use a for loop or while loop to do this, it is important that you understand these recursion steps to have a strong foundation to learn more complex recursive algorithm in the future.
In the next video, I will explain binary search which is very similar to linear search, and I will also explain why it is so useful.
Link to the Binary and Ternary Search in the Data Structure playlist: • Data Structures & Analysis of Algorithms
LIKE & SUBSCRIBE:
🔴 My Channel: / quocdatphung
🔴 My second channel: / @purifynature8479
