Which data structure is typically used to implement binary search efficiently?

  • Linked List
  • Queue
  • Sorted Array
  • Stack
Binary search is typically implemented on a sorted array. This is because the algorithm relies on the ability to efficiently discard half of the elements based on a comparison with the target value.
Add your answer
Loading...

Leave a comment

Your email address will not be published. Required fields are marked *