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 in Go.
This course has been designed to help you learn the fundamental concepts behind these algorithms.
What You’ll Learn
Throughout this course, we will be covering the following topics:
- Quick Sort in Go
- Insertion Sort in Go
- Bubble Sort in Go
- Merge Sort in Go
- Breadth-First Search
- Depth-First Search
- Binary Search
- Tree Search
- A* Search
We’ll also be briefly covering topics such as the space and time complexity of each of these algorithms!
This course is going to rely on some underlying knowledge of data structures as well as a familiarity with the Go syntax. If you haven’t already, I would recommend checking out my other course - Go Data Structures Course
My goal for this course is to cover all of the algorithms in depth, first with an overview video that covers how the algorithm works at a glance as well as some of the characteristics of that algorithm.
Once we’ve covered the theoretical side, we’ll then dive into VS Code and start implementing these algorithms from the ground up.
I’ll be sprinkling a few quizzes in the text sections below each video to help you affirm what you’ve just learned.