Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/ppenna/playground
:video_game: Algorithms and data structures made simple
https://github.com/ppenna/playground
algorithms c data-structures rust
Last synced: about 2 months ago
JSON representation
:video_game: Algorithms and data structures made simple
- Host: GitHub
- URL: https://github.com/ppenna/playground
- Owner: ppenna
- License: mit
- Created: 2023-01-06T01:54:03.000Z (almost 2 years ago)
- Default Branch: main
- Last Pushed: 2023-08-24T12:57:36.000Z (over 1 year ago)
- Last Synced: 2023-08-24T14:59:04.418Z (over 1 year ago)
- Topics: algorithms, c, data-structures, rust
- Language: C
- Homepage: http://desenvolvendosoftware.com.br
- Size: 250 KB
- Stars: 20
- Watchers: 1
- Forks: 2
- Open Issues: 2
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# Playground
[![en](https://img.shields.io/badge/lang-en-red.svg)](./README.md) [![pt-br](https://img.shields.io/badge/lang-pt--br-green.svg)](README.pt-br.md)
:video_game: Algorithms and data structures made simple.
This repository contains an example implementation of many popular algorithms
and data structures. Each example is implemented as a standalone program and
accompanies its own `README.md` with some background explanation.:hammer: This project is under construction. If you like it, please consider
giving it a star :star:Enjoy! :smiley:
_Read this in other languages: [English](README.md), [Português](README.pt-br.md)_
> ⚠️ This project is meant for learning purposes only. We discourage its use in
a production environment.## Table of Contents
- [Data Structures](#data-structures)
- [Linear Data Structures](#linear-data-structures)
- [Non-Linear Data Structures](#non-linear-data-structures)
- [Algorithms](#algorithms)
- [Sorting](#sorting)
- [Searching](#searching)
- [Strings](#strings)
- [Graphs](#graphs)
- [Compression](#compression)
- [Cryptography](#cryptography)
- [Machine Learning](#machine-learning)
- [Math](#math)
- [Image Processing](#image-processing)
- [Evolutionary Algorithms](#evolutionary-algorithms)## Data Structures
`B` - Basic, `I` - Intermediate, `A` - Advanced.
### Linear Data Structures
- `B` [Vectors](data-structures/vector/README.md)
- `B` [Linked Lists](data-structures/list/README.md)
- `B` [Stacks](data-structures/stack/README.md)
- `B` [Queues](data-structures/queue/README.md)
- `I` [Binary Heap](data-structures/binary-heap/README.md)
- `I` [Disjoint Sets](data-structures/disjoint-set/README.md)### Non-Linear Data Structures
- `B` Dictionaries
- Trees
- `B` [Binary Search Trees](data-structures/binary-search-tree/README.md)
- `I` [AVL Trees](data-structures/avl-tree/README.md)
- `A` [Red-Black Trees](data-structures/red-black-tree/README.md)
- `I` [Tries](data-structures/trie/README.md)
- `I` Graphs## Algorithms
`B` - Basic, `I` - Intermediate, `A` - Advanced.
### Sorting
- `B` [Bubble Sort](sorting/bubble-sort/README.md)
- `B` [Selection Sort](sorting/selection-sort/README.md)
- `B` [Insertion Sort](sorting/insertion-sort/README.md)
- `B` [Shell Sort](sorting/shell-sort/README.md)
- `B` [Merge Sort](sorting/merge-sort/README.pt-br.md)
- `I` [Quicksort](sorting/quicksort/README.md)
- `I` [Heapsort](sorting/heapsort/README.md)
- `I` [Counting Sort](sorting/counting-sort/README.md)### Searching
- `B` [Linear Search](searching/linear-search/README.md)
- `B` [Binary Search](searching/binary-search/README.md)
- `B` [Interpolation Search](searching/interpolation-search/README.md)
- `I` [Exponential Search](searching/exponential-search/README.md)### Strings
- `B` [Brute-Force Algorithm](string/search/brute-force/README.md)
- `I` [Knuth-Morris-Pratt Algorithm](string/search/kmp/README.md)
- `I` [Rabin-Karp Algorithm](string/search/rabin-karp/README.md)
- `I` [Boyer-Moore-Horspool Algorithm](string/search/bmh/README.md)
- `I` [Longest Common Subsequence](string/lcs/README.md)
- `I` [Levenshtein's Algorithm](string/levenshtein/README.md)### Graphs
- `I` [Breadth-First Search](graph/search/bfs/README.md)
- `I` [Depth-First Search](graph/search/dfs/README.md)
- `A` Kruskal's Algorithm
- `A` [Prim's Algorithm](graph/spanning-tree/prim/README.md)
- `A` [Dijkstra's Algorithm](graph/search/dijkstra/README.md)
- `A` Bellman-Ford's Algorithm### Compression
- `A` Huffman
- `A` Lempel-Ziv-Welch### Cryptography
- `B` [Caesar](cryptography/caesar-cipher/README.md)
- `I` DES
- `A` RSA### Machine Learning
- `A` [K-Nearest Neighbors](machine-learning/knn/README.md)
- `A` [K-Means Clustering](machine-learning/k-means/README.md)
- `A` Neural Networks
- `A` [Q-Learning](machine-learning/q-learning/README.md)### Math
- `B` [Operations with Matrices](math/matrix/README.md)
- `B` [Sieve of Eratosthenes](math/sieve-eratosthenes/README.md)
- `B` [Euclidean Algorithm](math/euclidean-algorithm/README.md)
- `I` Gaussian Elimination
- `A` Discrete Fourier Transform### Image Processing
- `I` Affine Transformations
- `I` Image Convolution### Evolutionary Algorithms
- `A` [Genetic Algorithm](evolutionary-algorithms/genetic-algorithm/README.md)
- `A` Particle Swarm Optimization