2.1 Binary Search Algorithm Explanation | Data Structures And Algorithm

Published: 17 July 2023
on channel: David tech

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.
Worst complexity: O(log n)
Average complexity: O(log n)
Best complexity: O(1)
Space complexity: O(1)

On this page of the site you can watch the video online 2.1 Binary Search Algorithm Explanation | Data Structures And Algorithm with a duration of online in good quality, which was uploaded by the user David tech 17 July 2023, share the link with friends and acquaintances, this video has already been watched 49 times on youtube and it was liked by 3 viewers. Enjoy your viewing!

1,925