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

Golang in how to achieve a binary search algorithm, many novices are not very clear about this, in order to help you solve this problem, the following editor will explain in detail for you, people with this need can come to learn, I hope you can gain something.

To find the index of a certain data in an ordered array, what you usually think of is a for loop, which can be done for data with a relatively small amount of data, but what if your data is hundreds of millions of pieces of data? At this time, the time complexity of the algorithm is O (n), which consumes computer resources.

Binary search can save a lot of system resources, and the time complexity is O (log n).

Package main

Import (

"fmt"

)

Func main () {

Var (

List [] int

)

For I: = 1; I right {/ / cannot find the existing data, return-1

Return-1

}

Mid: = (left + right) / 2 / / Intermediate id of each time

If target = = list [mid] {

Return mid

} else if target > list [mid] {

Return getIndex (list, mid+1, right, target)

} else {

Return getIndex (list, left, mid-1, target)

}

}

Is it helpful for you to read the above content? If you want to know more about the relevant knowledge or read more related articles, please follow the industry information channel, thank you for your support.

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.