In this video we cover all of the basics about graphs. We start be defining the different parts of a graph, and then jump into a real world example where we translate a map with cities and highways into a graph. Finally, we discuss some of the common attributes you might find on a graph, such as cost, capacity, directional edges, and even cycles, and relate these all to our graph derived from a map of cities and highways.
Learn how to sort a list with a custom type when you want to use a fallback search criteria. Eg sort by last name, then first name if those match.
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.
This tutorial demonstrates in detail how to adapt a bubble sort implementation written in Go to sort a list of numbers in reverse (non-increasing) order, rather than the default non-decreasing order. It is a useful trick to learn as it will help you custom sort other data types in the future.
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.