0
1.8kviews
Analysis of Binary Search
1 Answer
1
32views
  • Binary search is a fast search algorithm with run-time complexity of Ο(log n).

    • This search algorithm works on the principle of divide and conquers. For this algorithm to work properly, the data collection should be in the sorted form.

    • Binary search looks for a particular item by comparing the middle …

Create a free account to keep reading this post.

and 5 others joined a min ago.

Please log in to add an answer.