Shulou(Shulou.com)06/02 Report--

This article shows you how to achieve binary search in Python, the content is concise and easy to understand, it can definitely brighten your eyes. I hope you can get something through the detailed introduction of this article.

Binary search is a very widely used search algorithm, the purpose is to find a number you want from a list list, write it down as the target data, and return the index of this number, such as [5, 12, 3], want to find where 12 is, and then the answer should be 1. The direct method is to start from the beginning, compare one by one, if equal to return, first take 5 and 12, not equal to continue to the next, 12 = 12, so return 1, but if the list is very large, so the search is relatively slow, time complexity is O (n), and binary search is a more efficient search method, mathematics has learned dichotomy, I think the truth is similar. The time complexity of binary search is O (logn).

The general process of binary search is to first find the intermediate data of the array, then compare the target data with the intermediate data, return the intermediate data if the target data is equal, and continue to follow the same method on the right side of the list if the target data is larger than the intermediate data. Otherwise, look for it on the left; note here that the list in the search process is sorted, so the search is done by size when comparing here.

Here is a chestnut for binary search using Python

Def binary_search (array, query_value):

Low, high = 0, len (array)-1

While low

Welcome to subscribe "Shulou Technology Information " to get latest news, interesting things and hot topics in the IT industry, and controls the hottest and latest Internet news, technology news and IT industry trends.