Binary search implementation for DCP 24 problem

main.go

package main

import (
	"fmt"
	"math/rand"
	"time"
)

func binarySearch(overArray []int, bottom, top, breakFloor int) int {
	for bottom <= top {
		middlePoint := bottom + (top-bottom)/2
		if middlePoint == breakFloor {
			return middlePoint
		}
		if middlePoint < breakFloor {
			bottom = middlePoint + 1
		}
		if middlePoint > breakFloor {
			top = middlePoint - 1
		}
	}
	return -1
}

func main() {
	// Creating the building
	var building []int
	for c := 0; c < 100000; c++ {
		building = append(building, c)
	}
	// Generating the random targetFloor
	targetFloor := rand.New(rand.NewSource(time.Now().UnixNano())).Intn(len(building))

	bsFloor := binarySearch(building, 0, len(building), targetFloor)

	fmt.Println("Target floor found with binary search is ", bsFloor)
	fmt.Println("Random target floor previously generated is ", targetFloor)
}