Is Binary Search a Greedy Algorithm

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.

A greedy algorithm is any algorithm that follows the problem-solving heuristic of making the locally optimal choice at each stage.

In this session, you would get to know more about the topic and we would have a more detailed discussion.

So let us meet on 5th September 2022 in this interactive session.

Name of the Speaker: Jwala Chorasiya

About the Speaker: Intern/Educator at CodeChef | 4⭐ @CodeChef | MERN STACK| University Leader at Community Classroom

In this session, the speaker will take you through the journey inside out on this topic.

For more insights, attend the event and join the community!!

Support the community: commudle.com/communities/cdn-data-structures-and-algorithms