Binary Search Algorithm with Python | Computer Science
In this video , I was showing how we can search any element from array using Binary Search using python if element will not be in array then it will return - 1. the time complexity of this algorithm is O (n log n). The main condition of the binary search algorithm is array should be sorted.
In computer science, binary search, also known as half-interval search, logarithmic search, or binary chop, is a search algorithm that finds the position of a target value within a sorted array. Binary search compares the target value to the middle element of the array. Wikipedia
Worst complexity: O(log n)
Average complexity: O(log n)
Best complexity: O(1)
Space complexity: O(1)
Data structure: Array
I hope it will be helpful for you.
#Algorithm #ComputerScience #Python #SoftwareEngineer