Welcome to the Go Algorithms Crash Course! In this course, we are going to be covering some of the most common sorting and searching algorithms and how you can implement them in Go.
This course has been designed to help you learn the fundamental concepts behind these algorithms. For each one, we start with an overview of how it works, then dive into implementing it step-by-step.
What You’ll Learn
Throughout this course, we will be covering the following topics:
Sorting Algorithms
- Quick Sort
- Bubble Sort
- Insertion Sort
- Merge Sort
- Heap Sort
Searching Algorithms
- Depth-First Search
- Breadth-First Search
- Binary Search
- Tree Search
We’ll also be covering the time and space complexity of each algorithm so you know when to reach for which one.
Prerequisites
You should have a basic understanding of Go before diving in. If you’re brand new to Go, I’d recommend checking out the Beginner’s Guide to Go first.
You don’t need any prior algorithms or computer science knowledge — we’ll explain everything from scratch.
Let’s Go!
Right, that’s enough preamble — let’s dive into our first algorithm!