Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/morfly/cs-algorithms
https://github.com/morfly/cs-algorithms
algorithms bazel-example data-structures java kotlin python3 swift5
Last synced: 19 days ago
JSON representation
- Host: GitHub
- URL: https://github.com/morfly/cs-algorithms
- Owner: Morfly
- Created: 2020-09-27T10:55:55.000Z (over 4 years ago)
- Default Branch: master
- Last Pushed: 2020-10-09T15:34:50.000Z (over 4 years ago)
- Last Synced: 2024-11-11T20:42:22.079Z (3 months ago)
- Topics: algorithms, bazel-example, data-structures, java, kotlin, python3, swift5
- Language: Kotlin
- Homepage:
- Size: 85 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Algorithms and Data Structures Encyclopedia
**Work in progress...**
An encyclopedia of computer science algorithms and data structures.
## Available languages
- [Java](src/java)
- [Kotlin](src/kotlin)
- [Python](src/python)
- [Swift](src/swift)
- ...
## Algorithms
...
By default all the links below refer to `Kotlin` algorithm implementations. If you prefer another language feel free to check the list of [available languages](#available-languages).
`B` - Base, `A` - Advanced
### By category
- **Graph**
- `B` [Breadth-first traversal](src/kotlin/sequential/graph/bfs) - BFS
- `B` [Deapth-first traversal](src/kotlin/sequential/graph/dfs) - DFS, recursive and iterative implementations.
- `B` [Topological sorting](src/kotlin/sequential/graph/topologicalsort) - based on DFS, recursive and iterative implementations.
- `B` [Dijkstra's algorithm](src/kotlin/sequential/graph/dijkstra) - greedy algorithm, finding shortest/fastest path to vertex.
- **Maze**
- Generation
- ...
- Pathfinding
- ...
- **Sorting**
- `B` [Selection sort](src/kotlin/sequential/sorting/selectionsort)
- `B` [Insertion sort](src/kotlin/sequential/sorting/insertionsort)
- `B`, `A` [Shellsort](src/kotlin/sequential/sorting/shellsort) - including 14 gap sequences.
- `B` [Merge sort](src/kotlin/sequential/sorting/mergesort)
- `B` [Quicksort]() - including Lomuto's and Hoare's partition schemes.
- `B` [Bubble sort](src/kotlin/sequential/sorting/bubblesort)
- `B` [Radix sort](src/kotlin/sequential/sorting/radixsort)
- **Shuffling**
- `B` [Fisher-Yates shuffling](src/kotlin/sequential/shuffling/fisheryates)
- `A` [Sattolo shuffling](src/kotlin/sequential/shuffling/sattolo)
- ...
### By design paradigm
- **Greedy**
- `B` [Dijkstra's Algorithm](src/kotlin/sequential/graph/dijkstra) - greedy algorithm, finding shortest/fastest path to vertex.
- ...
- **Divide and conquer**
- ...
- **Dynamic programming**
- ...
## Data structures
- [Graph]()
- [Tree]()
- `B` [Binary search tree]()
- `A` [AVL tree]()
- `A` [Red-Black tree]()
- [Heap]() - including **max** and **min** version.
- [Hash table]()
- ...
## Project structure
```
algorithms
└── _tools
└── src
│ └── java
│ └── kotlіn
│ └── ...
│ └──
│ └── _util
│ └── parallel
│ │ └── ...
│ └── sequential
│ └── graph
│ └── sorting
│ └── ...
│ └──
│ └── BUILD <-- build target definition file
│ └──
└── WORKSPACE
```
## How to build source code
All the source code in this project is built with Bazel build system. [Learn more about Bazel...](https://bazel.build/)
### Why Bazel?
Bazel provides a unified way of building projects with **multiple** programming languages. Bazel's glanularity allows to have many build targets where each contains only source code related to the specific algorithm or data structure.
### Install on macOS
```bash
brew install bazelisk
```
### Install on Windows, Linux and macOS
```bash
npm install -g @bazel/bazelisk
```
Learn more about [other installation options](https://docs.bazel.build/versions/master/install-bazelisk.html).
### Run algorithms
In order to run desired algorithm use the following command:
```bash
bazelisk run @kotlіn//sequential/graph/dijkstra:dijkstra
```
Where `@kotlin` can be replaced with any of the [available languages](#available-languages).
## Useful references
- ...