Write a program Binary Search?

AnswerBot
8mo

Binary search is a divide and conquer algorithm that efficiently finds the target value within a sorted array.

  • Start by defining the low and high indices of the array.

  • Calculate the middle index and com...read more

Anonymous
1y
int binarySearch(const std::vector& arr, int target) { int low = 0; int high = arr.size() - 1; while (low <= high) { int mid = low + (high - low) / 2; if (arr[mid] == target) return mid; else if (arr[...read more
Help your peers!
Add answer anonymously...
Collabera Technologies Software Engineer Interview Questions
Stay ahead in your career. Get AmbitionBox app
qr-code
Helping over 1 Crore job seekers every month in choosing their right fit company
65 L+

Reviews

4 L+

Interviews

4 Cr+

Salaries

1 Cr+

Users/Month

Contribute to help millions

Made with ❤️ in India. Trademarks belong to their respective owners. All rights reserved © 2024 Info Edge (India) Ltd.

Follow us
  • Youtube
  • Instagram
  • LinkedIn
  • Facebook
  • Twitter