Binary search python

Binary search python

• 1.
  BINARY SEARCH PYTHON ~RECURSIVE AND ITERATIVE
• 2.
   Binary SearchAlgorithm 1. Recursive Method 2. Iterative Method  Complexity  Conclusion
• 3.
   The BinarySearch Algorithm finds an index of a particular element in the list. It is one of the fastest and most popular algorithms.  We can summarize the complete working of the Binary Search Algorithm in the following steps: 1. In the sorted array, find the middle element. 2. Compare x with the middle element. 3. If x equals the middle element, then the middle index is returned. Otherwise, the x will be compared with the middle item. 4. Else if x is greater than the middle item, then it will be compared to the right-side elements of the index. 5. Else if x is less than the mid element, then x will be compared to only the left side elements of the index. 6. We will choose either algorithm to run for the right half of the list or the left half of the list of items
• 4.
   The Recursivemethod follows the divide and conquer approach. In Recursive Binary Search, one function calls itself repeatedly until an element is found in the list. Output:
• 5.
  To learn IterativeMethod of Binary Search, visit the following link. https://www.codeleaks.io/binary-search-python/
• 6.
  Thank You. 