Binary search algorithm

Source: Internet
Author: User

The binary lookup algorithm (also known as the binary lookup algorithm) is relatively efficient and is a search algorithm for finding a particular element in an ordered array.

Steps:

The first step is to find the middle element of the array, and if the middle element in the array equals the element to be found, the lookup ends;

Step two: If the element you are looking for is greater than or less than the middle element of the array, look in the half of the array that is greater than or less than the middle element, and step one also starts from the middle element;

Step three: If the array is empty, the representative cannot be found;

The binary lookup algorithm reduces the search scope by half, and the time complexity is: Log (n)

Here are two ways to implement the algorithm (Loop implementation and recursive implementation):

Binary search algorithm

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.