https://github.com/morintd/algorithms-go
Implementation of multiple algorithms in Go.
https://github.com/morintd/algorithms-go
Last synced: 4 months ago
JSON representation
Implementation of multiple algorithms in Go.
- Host: GitHub
- URL: https://github.com/morintd/algorithms-go
- Owner: morintd
- Created: 2024-06-15T22:47:28.000Z (about 1 year ago)
- Default Branch: main
- Last Pushed: 2024-07-06T12:05:48.000Z (about 1 year ago)
- Last Synced: 2025-01-20T02:39:36.368Z (6 months ago)
- Language: Go
- Homepage:
- Size: 14.6 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# algorithms-go
Implementation of multiple algorithms in Go. Partially based on [The Last Algorithms Course You'll Ever Need](https://frontendmasters.com/courses/algorithms/) (originally in TypeScript).
## Includes
- Base Case Pathfinding
- Binary Search List
- Binary Search Tree (BST)
- Bubble Sort
- Double Linked List
- Graph (Breadth First Search on Weighted Adjacency Matrix, Depth First Search on Weighted Adjacency List)
- Heap (MinHeap)
- Merge Sort
- Queue
- Quicksort
- Stack
- Tree (Breadth First Search, Traversal PreOrder/InOrder/PostOrder)
- Two Crystall Balls problem
## Commands
```sh
$ make test
```