luke-else/Algorithms-DataStructures
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Updated Binary Search (Pointers)

Browse Source
This commit is contained in:
Luke Else 2021-11-30 21:24:37 +00:00
parent cbfa634e82
commit cffd8cfe40
1 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
BinarySearch/main.go
View File

@ -17,17 +17,17 @@ func main() {
testTimed(10000000)
}
func RecursiveBinarySearch(list []int, value int, start int, end int) int {
func RecursiveBinarySearch(list *[]int, value int, start int, end int) int {
var mid int = (start + end) / 2
if start == (end - 1) {
if list[mid] == value {
if (*list)[mid] == value {
return mid
}
return -1
}
if value < list[mid] {
if value < (*list)[mid] {
return RecursiveBinarySearch(list, value, start, mid)
}
return RecursiveBinarySearch(list, value, mid, end)
@ -79,7 +79,7 @@ func testTimed(value int) {
rnd := rand.Intn(i*mult) + 1
x := RecursiveBinarySearch(list, rnd, 0, len(list)-1)
x := RecursiveBinarySearch(&list, rnd, 0, len(list)-1)
//fmt.Println(time.Now().Sub(start), x, i*1000, "items")
fmt.Println("found number ", rnd, ":", x, " in a list of ", len(list), " items in ", time.Since(start))