Go Algorithms

This repository goes through The Last Algorithms Course You'll Need from Front End Masters and attempts to implement some of the data structures and algorithms in Go. Notes from the course also live here.

This is to help learn Go. Some of the data structures and algorithms might already be implemented in the Go standard library but will be implemented in a simple manner just to learn. They are not implemented to attempt to replace or be better than the current standard library.

---

Table Of Contents

1. Arrays and Searhcing - Provides basic ideas of searching arrays (shows basic searing slices in Go)
2. Sorting - Provides basic sorting algorithms written in Go (includes Bubble Sort and Quick Sort).
3. Queue - Provides a basic Queue implementation written in Go.
4. Stack - Provides a basic Stack implementation written in Go.
5. Maze Solver - Provides a basic implementaion of solving a maze in Go.
6. Linked List - Proved a basic doubly linked list implementation in Go.
7. Trees - Provides notes and basic implementation of different trees in Go.
8. Priority Queue - MinHeap - Prvides notes and basic implementation of a MinHeap Priority Queue in Go.
9. Tries/Autocomplete - Builds out a basic autocompletition to demonstrate the use of Tries in Go.