Contents

- 1 Where can binary search be used?
- 2 Where we Cannot use binary search algorithm?
- 3 What are the limitations of binary search algorithm?
- 4 How can binary search be used in arrays?
- 5 Can you use binary search on an array?
- 6 Can binary search be used for strings?
- 7 Which of the following is not a limitation of binary search algorithm?
- 8 Which of the following is not an application of binary search?
- 9 Can you implement a binary search algorithm?
- 10 Can we use binary search on unsorted array?

## Where can binary search be used?

In its simplest form, binary search is used **to quickly find a value in a sorted sequence** (consider a sequence an ordinary array for now). We'll call the sought value the target value for clarity. Binary search maintains a contiguous subsequence of the starting sequence where the target value is surely located.

## Where we Cannot use binary search algorithm?

Discussion Forum

Que. | Binary search algorithm can not be applied to |
---|---|

b. | sorted binary trees |

c. | sorted linear array |

d. | pointer array |

Answer:sorted linked list |

## What are the limitations of binary search algorithm?

The major limitation of binary search is that **there is a need for the sorted array to perform the binary search operation**. If the array is not sorted the output is either not correct or maybe after a long number of steps and according to the data structure, the output should come in a minimum number of steps.

## How can binary search be used in arrays?

Step 1 : Find the middle element of array. using , middle = initial_value + end_value / 2 ; Step 2 : If middle = element, return 'element found' and index. Step 3 : if middle > element, call the function with **end_value** = middle – 1 . Step 4 : if middle < element, call the function with start_value = middle + 1 .

## Can you use binary search on an array?

Binary search **works on sorted arrays**. … If the target value matches the element, its position in the array is returned. If the target value is less than the element, the search continues in the lower half of the array. If the target value is greater than the element, the search continues in the upper half of the array.

## Can binary search be used for strings?

Searching a string using binary search algorithm is something tricky when compared to searching a number. Because we can compare 2 numerics directly, but in the case of strings it's **not** as simple as number comparison.

## Which of the following is not a limitation of binary search algorithm?

Q. | Which of the following is not a limitation of binary search algorithm ? |
---|---|

D. | there must be a mechanism to access middle element directly |

Answer» a. binary search algorithm is not efficient when the data elements are more than 1000. |

## Which of the following is not an application of binary search?

Which of the following is not an application of binary search? Explanation: In Binary search, the elements in the list should be sorted. It is applicable only for ordered list. Hence **Binary search in unordered list** is not an application.

## Can you implement a binary search algorithm?

Yes, you guessed it right: you need to implement a binary search in **Java**, and you need to write both iterative and recursive binary search algorithms. In computer science, a binary search, or half-interval search, is a divide and conquer algorithm that locates the position of an item in a sorted array.

## Can we use binary search on unsorted array?

You can use binary search on **only one kind of "unsorted" array** – the rotated array. It can be done in O(log n) time like a typical binary search, but uses an adjusted divide and conquer approach.