This implementations are merely educational and may not be as efficient in a production environment. Use at your own risk.
This repository includes common data structures and algorithms.
This repository has two main purposes:
- Show the data structures and algorithms fundamentals, as well as a concrete implementation.
- Serve as a guide to the Go language.
- Linked list
- Stack (linked list implementation)
- Queue (double stack implementation)
- Infix operation evaluation
- Sorting:
- Merge sort
- Quick sort
- Quick sort (randomized pivot)
- Bubble sort
- Insertion sort
- Radix sort (using queue sorting)
- Bucket sort (using insertion sort for buckets)
- Counting sort
Miguel Miranda (@mmiranda96)