Black Friday Sale - 50% off Go Courses!
I am able to provide free resources like this and Gophercises by selling premium Go courses. If you have found any of my free resources helpful, please consider checking out the premium courses. They are both 50% off until Dec 2nd, you'll learn an incredible amount of Go in the process, and it helps me continue to provide free resources like this.
→ Web Development with Go
→ Test with Go
Both courses have lifetime access, a 30-day money back guarantee, and free updates.
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.
©2024 Jonathan Calhoun. All rights reserved.