Black Friday Sale!
Save 50% on Web Development with Go and Test with Go until Dec 3.
Both courses have lifetime access, a 30-day money back guarantee, and free updates. This is also the biggest discount I offer on the courses, and I only do it once a year around Black Friday.
Thank you for your continued support and happy coding!
Jon Calhoun
Learn to implement a binary search where you can find strings regardless of their case when searching in a previously sorted list of strings.
This tutorial demonstrates how to implement an iterative (without recursion) binary search that can find a number in a sorted list of numbers using Golang.
This tutorial explains how binary search, works and then describes how it would be used to find a number in a sorted list with visual examples.
Jon Calhoun is a full stack web developer who teaches about Go, web development, algorithms, and anything programming. If you haven't already, you should totally check out his Go courses.
Previously, Jon worked at several statups including co-founding EasyPost, a shipping API used by several fortune 500 companies. Prior to that Jon worked at Google, competed at world finals in programming competitions, and has been programming since he was a child.
©2018 Jonathan Calhoun. All rights reserved.