Searching Techniques | Linear & Binary Search in Python (HINDI)

#LinearSearch #BinarySearch #PythonProgramming

Searching Techniques
Linear Search (Sequential Search)
Binary Search (Divide and Conquer Method)

Linear search or sequential search is a method for finding a particular value in a list, that consists of checking every one of its elements, one at a time and in sequence, until the desired one is found.

A Binary Search or half-interval Search algorithm finds the position of a specified input value (the search "key") within a list/array sorted by key value. For binary search, the list should be arranged in ascending or descending order.
In each step, the algorithm compares the search key value with the key value of the middle element of the list/array.

If the keys match, then a matching element has been found and its index, or position, is returned. Otherwise, if the search key is less than the middle element's key, then the algorithm repeats its action on the sub-List/sub-array to the left of the middle element or, if the search key is greater, on the sub-list/sub-array to the right.
If the remaining array to be searched is empty, then the key cannot be found in the List/array and a special "not found" indication is returned.

A binary search is a  divide and conquer search algorithm.
A linear search will search every Node/Value, whereas, a binary search will remove half of the remaining nodes to search with each step.