This algorithm is an efficient algorithm for finding an item from a sorted list of items. It works by repeatedly dividing in half the portion of the list that could contain the item, until you've narrowed down the possible locations to just one.
1- Clone the repository
git clone https://github.com/Sherlockzen/go-binary-search.git
2- Install GoLang
3- Inside the folder you have cloned run this:
go run .