Question

Define binary sorting technique.​

Answer 1

Answer :

Binary search is an efficient algorithm for finding an item from a sorted list of items is called binary sorting technique.

Explanation :

It works by repeatedly dividing in half the portion of the list that could contain the item, until you've narrowed down the possible locations to just one.

Have a good time!!!

Answer 2

YoUr AnsWer :-

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. If the search ends with the remaining half being empty, the target is not in the array.

Answered By :-

@Perfectstorm