fonte: wikipedia
In computer science, a binary search or half-interval search algorithm finds the position of a target value within a sorted array.[1][2] The binary search algorithm can be classified as a dichotomic divide and conquer search algorithm and executes in logarithmic time.
Sem comentários:
Enviar um comentário