Golang二分查找算法的简单达成
发布时间：2021-12-11 18:12:25 所属栏目：教程 来源：互联网
导读：Golang二分查找算法的简单实现 package main import ( fmt ) type Searchable interface { Len() int Less(int, int) bool Equal(int, interface{}) bool } type List []int func (l List) Len() int { return len(l) } func (l List) Less(first int, second
|
Golang二分查找算法的简单实现 package main import ( "fmt" ) type Searchable interface { Len() int Less(int, int) bool Equal(int, interface{}) bool } type List []int func (l List) Len() int { return len(l) } func (l List) Less(first int, second int) bool { if l[first] < l[second] { return true } return false } func (l List) Equal(index int, item interface{}) bool { if value, ok := item.(int); ok { if l[index] == value { return true } } return false } func main() { list := []int{1, 2, 3, 5, 9} index := binSearch(list, 3) fmt.Printf("The index of 3 in the list is %dn", index) index = binSearch(list, 4) fmt.Printf("The index of 4 in the list is %dn", index) } func binSearch(list List, item interface{}) int { startFlag := 0 stopFlag := list.Len() - 1 middleFlag := (startFlag + stopFlag) / 2 for (!list.Equal(middleFlag, item)) && (startFlag < stopFlag) { if list.Less(startFlag, stopFlag) { startFlag = middleFlag + 1 } else { stopFlag = middleFlag - 1 } middleFlag = (startFlag + stopFlag) / 2 } if list.Equal(middleFlag, item) { return middleFlag } else { return -1 } }  （编辑：东莞站长网） 【声明】本站内容均来自网络，其相关言论仅代表作者个人观点，不代表本站立场。若无意侵犯到您的权利，请及时与联系站长删除相关内容! |
