Question

How binary search work in java

Answer 1

you mean the coding part?

Answer 2

For binary search, for java or any language, you need to have the objects sorted in some sequence. In Java it will be easy if the objects are array items sorted on a key. After sorting, you start search. In a sequence, you compare your key with the middle key of the sorted array. If your search key is the middle key, then your job is done, otherwise, search either the left half or the right half of middle key, depending on the comparison result. Continue until you find the key(success), or the list can't be divided any more, in that case the search failed.

Answer 3

java the coding and how is processs

Answer 4

Andresfon12, try writing the code yourself, process is already explained.

Answer 5

k