golang 常用的排序

func BinaryFind(slice []int,val int,leftIndex int,rightIndex int) bool {
if leftIndex > rightIndex {
return false
}

middleIndex := (leftIndex + rightIndex) / 2

if slice[middleIndex] == val{
return true
}else if slice[middleIndex] < val {
return BinaryFind(slice,val,middleIndex+1,rightIndex)
}else {
return BinaryFind(slice,val,leftIndex,middleIndex-1)
}
}