Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/Thuva4/Algorithms
Collection of algorithms in multiple programming languages.
https://github.com/Thuva4/Algorithms
algorithms algorithms-implemented clustering-algorithm fast-algorithm hacktoberfest multiple-algorithms search-algorithm
Last synced: 4 days ago
JSON representation
Collection of algorithms in multiple programming languages.
- Host: GitHub
- URL: https://github.com/Thuva4/Algorithms
- Owner: thuva4
- License: apache-2.0
- Created: 2017-10-04T05:51:01.000Z (about 7 years ago)
- Default Branch: master
- Last Pushed: 2023-09-30T22:48:09.000Z (about 1 year ago)
- Last Synced: 2024-11-06T22:40:42.696Z (10 days ago)
- Topics: algorithms, algorithms-implemented, clustering-algorithm, fast-algorithm, hacktoberfest, multiple-algorithms, search-algorithm
- Language: C++
- Homepage: https://thuva4.github.io/Algorithms/
- Size: 1.53 MB
- Stars: 487
- Watchers: 20
- Forks: 543
- Open Issues: 8
-
Metadata Files:
- Readme: README-CN.md
- Contributing: CONTRIBUTING.md
- License: LICENSE
- Code of conduct: CODE_OF_CONDUCT.md
- Security: SECURITY.md
Awesome Lists containing this project
README
# 算法实例
[](https://deepscan.io/dashboard#view=project&tid=6243&pid=8132&bid=92442)
这个仓库包含各种各样的，由不同的编程语言实现的算法实例。
## 不同语言的算法实现
语言 | C++ | Python | Java | JavaScript | C | Go | C# | Ruby | Swift | Scala | Haskell | Kotlin | Rust | Perl | BrainFuck | Crystal | Racket |
|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|
Fibonacci | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: |
BubbleSort | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | | | :+1: | :+1: | :+1: | | |
LinearSearch | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | | :+1: | :+1: | | :+1: | :+1: | :+1: | | | :+1: |
InsertionSort | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | | :+1: | :+1: | | | | |
QuickSort | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | | :+1: | :+1: | :+1: | | | | |
BinarySearch | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | | | :+1: | | :+1: | | | |
MergeSort | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | | | | | | |
GreatestCommonDivisor | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | | :+1: | | :+1: | | | | | |
SelectionSort | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | | :+1: | | | :+1: | | | | |
Doomsday | :+1: | :+1: | :+1: | :+1: | | :+1: | :+1: | :+1: | :+1: | | | :+1: | | | | | |
HeapSort | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | | :+1: | | | | | | | | :+1: | |
XorSwap | :+1: | :+1: | :+1: | :+1: | :+1: | | :+1: | | :+1: | :+1: | | | | | | | |
Factorial | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | | | | | | | :+1: | | | | |
HammingDistance | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | | :+1: | | | | | | | | | |
Kadanes | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | | | | | | | | | | |
FisherYatesShuffle | :+1: | :+1: | :+1: | :+1: | | :+1: | :+1: | :+1: | | | | | | | | | |
LongestCommonSubsequence | :+1: | :+1: | :+1: | :+1: | :+1: | | | :+1: | | | | | | | | | |
Dijkstras | :+1: | :+1: | :+1: | :+1: | | :+1: | :+1: | | | | | | | | | | |
CountingSort | :+1: | :+1: | :+1: | :+1: | | | | :+1: | :+1: | | | | | | | | |
DepthFirstSearch | :+1: | :+1: | :+1: | :+1: | :+1: | | | | | | | | | | | | |
FastFourierTransform | :+1: | :+1: | :+1: | :+1: | :+1: | | | | | | | | | | | | |
FloydsAlgorithm | :+1: | :+1: | :+1: | | :+1: | :+1: | | | | | | | | | | | |
RadixSort | :+1: | :+1: | :+1: | :+1: | :+1: | | | | | | | | | | | | |
TernarySearch | :+1: | :+1: | :+1: | :+1: | :+1: | | | | | | | | | | | | |
BellmanFord | :+1: | :+1: | :+1: | | | | :+1: | | | | :+1: | | | | | | |
BinaryGCD | :+1: | :+1: | :+1: | | | :+1: | | | | | :+1: | | | | | | |
ShellSort | :+1: | :+1: | :+1: | :+1: | | | | :+1: | | | | | | | | | |
ExtendedEuclidean | :+1: | :+1: | | :+1: | :+1: | | | | | | | | | | | | |
SegmentedSieve | :+1: | :+1: | :+1: | | :+1: | | | | | | | | | | | | |
BreadthFirstSearch | :+1: | :+1: | :+1: | :+1: | | | | | | | | | | | | | |
FloodFill | :+1: | :+1: | :+1: | | | | | | :+1: | | | | | | | | |
LongestIncreasingSubsequence | :+1: | :+1: | :+1: | :+1: | | | | | | | | | | | | | |
UnaryCoding | :+1: | :+1: | :+1: | :+1: | | | | | | | | | | | | | |
QuickSelect | | :+1: | :+1: | :+1: | | :+1: | | | | | | | | | | | |
SieveOfEratosthenes | | :+1: | :+1: | :+1: | | | | | | | :+1: | | | | | | |
BitonicSort | :+1: | | :+1: | | :+1: | | | | | | | | | | | | |
PrimeCheck | :+1: | :+1: | | | :+1: | | | | | | | | | | | | |
SieveofEratosthenes | :+1: | | | | :+1: | | :+1: | | | | | | | | | | |
Swap | | | | | :+1: | :+1: | | | | :+1: | | | | | | | |
UnionFind | | :+1: | :+1: | | :+1: | | | | | | | | | | | | |
BorweinsAlgorithm | :+1: | :+1: | :+1: | | | | | | | | | | | | | | |
CountingInversions | :+1: | | :+1: | | | :+1: | | | | | | | | | | | |
CycleSort | :+1: | :+1: | :+1: | | | | | | | | | | | | | | |
EditDistance | :+1: | :+1: | | | | | | | :+1: | | | | | | | | |
KnuthMorrisPrath | :+1: | :+1: | :+1: | | | | | | | | | | | | | | |
Permutations | :+1: | :+1: | | :+1: | | | | | | | | | | | | | |
RabinKarp | :+1: | :+1: | :+1: | | | | | | | | | | | | | | |
TopologicalSort | :+1: | :+1: | :+1: | | | | | | | | | | | | | | |
DiffieHellman | | :+1: | | | | :+1: | | | | | :+1: | | | | | | |
knapsack | | | :+1: | | :+1: | | | | | | | | | | | | |
AStarSearch | :+1: | :+1: | | | | | | | | | | | | | | | |
BitapAlgorithm | :+1: | :+1: | | | | | | | | | | | | | | | |
CocktailSort | :+1: | | :+1: | | | | | | | | | | | | | | |
ConjugateGradient | :+1: | :+1: | | | | | | | | | | | | | | | |
JohnsonAlgorithm | :+1: | :+1: | | | | | | | | | | | | | | | |
Knapsack | :+1: | | | :+1: | | | | | | | | | | | | | |
KruskalsAlgorithm | :+1: | | :+1: | | | | | | | | | | | | | | |
LongestPath | :+1: | :+1: | | | | | | | | | | | | | | | |
Minimax | :+1: | | | | | :+1: | | | | | | | | | | | |
BestFirstSearch | | | :+1: | | | | | :+1: | | | | | | | | | |
ConnectedComponentLabeling | | | | | :+1: | | | | | | | | | | | | |
LeakyBucket | | | | | :+1: | | | | | | | | | | | | |
PostmanSort | | | | | :+1: | | | | | | | | | | | | |
BinaryTree | :+1: | | | | | | | | | | | | | | | | |
CoinChange | :+1: | | | | | | | | | | | | | | | | |
Combination | :+1: | | | | | | | | | | | | | | | | |
DungeonGame | :+1: | | | | | | | | | | | | | | | | |
EulerToient | :+1: | | | | | | | | | | | | | | | | |
FenwickTree | :+1: | | | | | | | | | | | | | | | | |
HeavyLightDecomposition | :+1: | | | | | | | | | | | | | | | | |
InFixToPostFix | :+1: | | | | | | | | | | | | | | | | |
InverseFastFourierTransform | :+1: | | | | | | | | | | | | | | | | |
JosephusProblem | :+1: | | | | | | | | | | | | | | | | |
LongestBitonicSubsequence | :+1: | | | | | | | | | | | | | | | | |
LongestSubsetZeroSum | :+1: | | | | | | | | | | | | | | | | |
MatrixExponentiation | :+1: | | | | | | | | | | | | | | | | |
ModifiedBinarySearch | :+1: | | | | | | | | | | | | | | | | |
PersistentDataStructures | :+1: | | | | | | | | | | | | | | | | |
PrimalityTests | :+1: | | | | | | | | | | | | | | | | |
Prims | :+1: | | | | | | | | | | | | | | | | |
PruferCode | :+1: | | | | | | | | | | | | | | | | |
SegmentTree | :+1: | | | | | | | | | | | | | | | | |
SequenceAlignment | :+1: | | | | | | | | | | | | | | | | |
StringToToken | :+1: | | | | | | | | | | | | | | | | |
StronglyConnectedGraph | :+1: | | | | | | | | | | | | | | | | |
TarjansOfflineLCA | :+1: | | | | | | | | | | | | | | | | |
VEGASAlgorithm | :+1: | | | | | | | | | | | | | | | | |
Cocktailshakersort | | | | | | :+1: | | | | | | | | | | | |
DynamicProgramming | | | :+1: | | | | | | | | | | | | | | |
EdmondsKarp | | | :+1: | | | | | | | | | | | | | | |
ElevatorAlgorithm | | | :+1: | | | | | | | | | | | | | | |
HistogramEqualization | | | :+1: | | | | | | | | | | | | | | |
MinMaxABPruning | | | :+1: | | | | | | | | | | | | | | |
PearsonHashing | | | :+1: | | | | | | | | | | | | | | |
RodCuttingAlgorithm | | | :+1: | | | | | | | | | | | | | | |
PartialSort | | | | :+1: | | | | | | | | | | | | | |
AhoCorasick | | :+1: | | | | | | | | | | | | | | | |
BloomFilter | | :+1: | | | | | | | | | | | | | | | |
Luhn | | :+1: | | | | | | | | | | | | | | | |
Sumset | | :+1: | | | | | | | | | | | | | | | |
[算法列表](Algorithms.md)
文件目录结构应该有如下格式：[**Algorithm name**]/[**language**]/**file**
*举例*
* **BubbleSort/Go/BubbleSort.go**
* **QuickSort/C++/QuickSort.cpp**
## License
[Apache License 2.0](LICENSE)