BinarySearchAlgorithim on sorted array

binarySearch.go

package main

import (
	"fmt"
)

func main() {
	fmt.Println("Hello, World!")

  arr := []int{1,2,3,4}

  fmt.Println(binarySearch(arr, 3))
}


func binarySearch(arr []int , target int) int{

  if len(arr) == 0 {
    return -1
  }

  left := 0
  right := len(arr)-1
  
  for left <= right {
      mid := left + (right - left) / 2

      if arr[mid] == target {
        return mid
      } else if arr[mid] < target {
          left = mid + 1
      } else {
          left = mid - 1
      }
  }

  return -1
}