Algorithm Implementations in Golang
This repository contains various algorithms implemented in the Go programming language. The algorithms are categorized according to their type, such as btree, ratelimit, skip-list and dynamic programming.
The list of algorithms implemented in this repository is as follows:
| no | name | is complete |
|---|---|---|
| 1 | skip list | ✔️ |
| 2 | b tree | ✔️ |
| 3 | bp tree | ing |
| 4 | ratelimit | ✔️ |
| 5 | radix tree | ✔️ |
| 6 | quorum nwr | ✔️ |
| 7 | zab / vs / paxos / raft | |
| 8 | lru / lfu / fifo | ing |
| 9 | random sampling without replacement | |
| 10 | cpu cache line test | ✔️ |
Getting Started
Prerequisites
To run the programs in this repository, you need to have Go installed on your machine. You can download and install Go from the official website: https://golang.org/dl/
Installation
To download the code in this repository, you can either download the ZIP file or clone the repository using Git:
Usage
Do not need to use it, just for learning.
Contributing
Contributions are always welcome. If you have implemented an algorithm in Go that is not already present in this repository, you can create a pull request with your implementation.
License
This repository is licensed under the MIT License. See the LICENSE file for more information.