Skip to content

Commit 0f07a4e

Browse files
thuva4thuva4
committed
Automated readme update
1 parent ff1d5a9 commit 0f07a4e

File tree

2 files changed

+58
-54
lines changed

2 files changed

+58
-54
lines changed

‎README-CN.md

Lines changed: 29 additions & 27 deletions
Original file line numberDiff line numberDiff line change
@@ -7,7 +7,7 @@
77
## 不同语言的算法实现
88

99

10-
语言 | C++ | Java | Python | JavaScript | C | Go | C# | Ruby | Swift | Scala | Haskell | Kotlin | Rust | Perl | BrainFuck | Crystal | Racket |
10+
语言 | C++ | Python | Java | JavaScript | C | Go | C# | Ruby | Swift | Scala | Haskell | Kotlin | Rust | Perl | BrainFuck | Crystal | Racket |
1111
|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|
1212
Fibonacci | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: |
1313
BubbleSort | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | | | :+1: | :+1: | :+1: | | |
@@ -36,39 +36,39 @@ TernarySearch | :+1: | :+1: | :+1: | :+1: | :+1: | | | | | | | |
3636
BellmanFord | :+1: | :+1: | :+1: | | | | :+1: | | | | :+1: | | | | | | |
3737
BinaryGCD | :+1: | :+1: | :+1: | | | :+1: | | | | | :+1: | | | | | | |
3838
ShellSort | :+1: | :+1: | :+1: | :+1: | | | | :+1: | | | | | | | | | |
39-
ExtendedEuclidean | :+1: | | :+1: | :+1: | :+1: | | | | | | | | | | | | |
39+
ExtendedEuclidean | :+1: | :+1: | | :+1: | :+1: | | | | | | | | | | | | |
4040
SegmentedSieve | :+1: | :+1: | :+1: | | :+1: | | | | | | | | | | | | |
4141
BreadthFirstSearch | :+1: | :+1: | :+1: | :+1: | | | | | | | | | | | | | |
4242
FloodFill | :+1: | :+1: | :+1: | | | | | | :+1: | | | | | | | | |
4343
LongestIncreasingSubsequence | :+1: | :+1: | :+1: | :+1: | | | | | | | | | | | | | |
4444
UnaryCoding | :+1: | :+1: | :+1: | :+1: | | | | | | | | | | | | | |
4545
QuickSelect | | :+1: | :+1: | :+1: | | :+1: | | | | | | | | | | | |
4646
SieveOfEratosthenes | | :+1: | :+1: | :+1: | | | | | | | :+1: | | | | | | |
47-
BitonicSort | :+1: | :+1: | | | :+1: | | | | | | | | | | | | |
48-
PrimeCheck | :+1: | | :+1: | | :+1: | | | | | | | | | | | | |
47+
BitonicSort | :+1: | | :+1: | | :+1: | | | | | | | | | | | | |
48+
PrimeCheck | :+1: | :+1: | | | :+1: | | | | | | | | | | | | |
4949
SieveofEratosthenes | :+1: | | | | :+1: | | :+1: | | | | | | | | | | |
5050
Swap | | | | | :+1: | :+1: | | | | :+1: | | | | | | | |
5151
UnionFind | | :+1: | :+1: | | :+1: | | | | | | | | | | | | |
5252
BorweinsAlgorithm | :+1: | :+1: | :+1: | | | | | | | | | | | | | | |
53-
CountingInversions | :+1: | :+1: | | | | :+1: | | | | | | | | | | | |
53+
CountingInversions | :+1: | | :+1: | | | :+1: | | | | | | | | | | | |
5454
CycleSort | :+1: | :+1: | :+1: | | | | | | | | | | | | | | |
55-
EditDistance | :+1: | | :+1: | | | | | | :+1: | | | | | | | | |
55+
EditDistance | :+1: | :+1: | | | | | | | :+1: | | | | | | | | |
5656
KnuthMorrisPrath | :+1: | :+1: | :+1: | | | | | | | | | | | | | | |
57-
Permutations | :+1: | | :+1: | :+1: | | | | | | | | | | | | | |
57+
Permutations | :+1: | :+1: | | :+1: | | | | | | | | | | | | | |
5858
RabinKarp | :+1: | :+1: | :+1: | | | | | | | | | | | | | | |
5959
TopologicalSort | :+1: | :+1: | :+1: | | | | | | | | | | | | | | |
60-
DiffieHellman | | | :+1: | | | :+1: | | | | | :+1: | | | | | | |
61-
knapsack | | :+1: | | | :+1: | | | | | | | | | | | | |
62-
AStarSearch | :+1: | | :+1: | | | | | | | | | | | | | | |
63-
BitapAlgorithm | :+1: | | :+1: | | | | | | | | | | | | | | |
64-
CocktailSort | :+1: | :+1: | | | | | | | | | | | | | | | |
65-
ConjugateGradient | :+1: | | :+1: | | | | | | | | | | | | | | |
66-
JohnsonAlgorithm | :+1: | | :+1: | | | | | | | | | | | | | | |
60+
DiffieHellman | | :+1: | | | | :+1: | | | | | :+1: | | | | | | |
61+
knapsack | | | :+1: | | :+1: | | | | | | | | | | | | |
62+
AStarSearch | :+1: | :+1: | | | | | | | | | | | | | | | |
63+
BitapAlgorithm | :+1: | :+1: | | | | | | | | | | | | | | | |
64+
CocktailSort | :+1: | | :+1: | | | | | | | | | | | | | | |
65+
ConjugateGradient | :+1: | :+1: | | | | | | | | | | | | | | | |
66+
JohnsonAlgorithm | :+1: | :+1: | | | | | | | | | | | | | | | |
6767
Knapsack | :+1: | | | :+1: | | | | | | | | | | | | | |
68-
KruskalsAlgorithm | :+1: | :+1: | | | | | | | | | | | | | | | |
69-
LongestPath | :+1: | | :+1: | | | | | | | | | | | | | | |
68+
KruskalsAlgorithm | :+1: | | :+1: | | | | | | | | | | | | | | |
69+
LongestPath | :+1: | :+1: | | | | | | | | | | | | | | | |
7070
Minimax | :+1: | | | | | :+1: | | | | | | | | | | | |
71-
BestFirstSearch | | :+1: | | | | | | :+1: | | | | | | | | | |
71+
BestFirstSearch | | | :+1: | | | | | :+1: | | | | | | | | | |
7272
ConnectedComponentLabeling | | | | | :+1: | | | | | | | | | | | | |
7373
LeakyBucket | | | | | :+1: | | | | | | | | | | | | |
7474
PostmanSort | | | | | :+1: | | | | | | | | | | | | |
@@ -81,6 +81,7 @@ FenwickTree | :+1: | | | | | | | | | | | | | | | |
8181
HeavyLightDecomposition | :+1: | | | | | | | | | | | | | | | | |
8282
InFixToPostFix | :+1: | | | | | | | | | | | | | | | | |
8383
InverseFastFourierTransform | :+1: | | | | | | | | | | | | | | | | |
84+
JosephusProblem | :+1: | | | | | | | | | | | | | | | | |
8485
LongestBitonicSubsequence | :+1: | | | | | | | | | | | | | | | | |
8586
LongestSubsetZeroSum | :+1: | | | | | | | | | | | | | | | | |
8687
MatrixExponentiation | :+1: | | | | | | | | | | | | | | | | |
@@ -96,17 +97,18 @@ StronglyConnectedGraph | :+1: | | | | | | | | | | | | |
9697
TarjansOfflineLCA | :+1: | | | | | | | | | | | | | | | | |
9798
VEGASAlgorithm | :+1: | | | | | | | | | | | | | | | | |
9899
Cocktailshakersort | | | | | | :+1: | | | | | | | | | | | |
99-
DynamicProgramming | | :+1: | | | | | | | | | | | | | | | |
100-
EdmondsKarp | | :+1: | | | | | | | | | | | | | | | |
101-
ElevatorAlgorithm | | :+1: | | | | | | | | | | | | | | | |
102-
HistogramEqualization | | :+1: | | | | | | | | | | | | | | | |
103-
MinMaxABPruning | | :+1: | | | | | | | | | | | | | | | |
104-
PearsonHashing | | :+1: | | | | | | | | | | | | | | | |
105-
RodCuttingAlgorithm | | :+1: | | | | | | | | | | | | | | | |
100+
DynamicProgramming | | | :+1: | | | | | | | | | | | | | | |
101+
EdmondsKarp | | | :+1: | | | | | | | | | | | | | | |
102+
ElevatorAlgorithm | | | :+1: | | | | | | | | | | | | | | |
103+
HistogramEqualization | | | :+1: | | | | | | | | | | | | | | |
104+
MinMaxABPruning | | | :+1: | | | | | | | | | | | | | | |
105+
PearsonHashing | | | :+1: | | | | | | | | | | | | | | |
106+
RodCuttingAlgorithm | | | :+1: | | | | | | | | | | | | | | |
106107
PartialSort | | | | :+1: | | | | | | | | | | | | | |
107-
AhoCorasick | | | :+1: | | | | | | | | | | | | | | |
108-
BloomFilter | | | :+1: | | | | | | | | | | | | | | |
109-
Sumset | | | :+1: | | | | | | | | | | | | | | |
108+
AhoCorasick | | :+1: | | | | | | | | | | | | | | | |
109+
BloomFilter | | :+1: | | | | | | | | | | | | | | | |
110+
Luhn | | :+1: | | | | | | | | | | | | | | | |
111+
Sumset | | :+1: | | | | | | | | | | | | | | | |
110112

111113

112114
[算法列表](Algorithms.md)

‎README.md

Lines changed: 29 additions & 27 deletions
Original file line numberDiff line numberDiff line change
@@ -7,7 +7,7 @@ This repository contains examples of various algorithms which were written on di
77
## Implemented algorithms with languages:
88

99

10-
Language | C++ | Java | Python | JavaScript | C | Go | C# | Ruby | Swift | Scala | Haskell | Kotlin | Rust | Perl | BrainFuck | Crystal | Racket |
10+
Language | C++ | Python | Java | JavaScript | C | Go | C# | Ruby | Swift | Scala | Haskell | Kotlin | Rust | Perl | BrainFuck | Crystal | Racket |
1111
|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|
1212
Fibonacci | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: |
1313
BubbleSort | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | | | :+1: | :+1: | :+1: | | |
@@ -36,39 +36,39 @@ TernarySearch | :+1: | :+1: | :+1: | :+1: | :+1: | | | | | | | |
3636
BellmanFord | :+1: | :+1: | :+1: | | | | :+1: | | | | :+1: | | | | | | |
3737
BinaryGCD | :+1: | :+1: | :+1: | | | :+1: | | | | | :+1: | | | | | | |
3838
ShellSort | :+1: | :+1: | :+1: | :+1: | | | | :+1: | | | | | | | | | |
39-
ExtendedEuclidean | :+1: | | :+1: | :+1: | :+1: | | | | | | | | | | | | |
39+
ExtendedEuclidean | :+1: | :+1: | | :+1: | :+1: | | | | | | | | | | | | |
4040
SegmentedSieve | :+1: | :+1: | :+1: | | :+1: | | | | | | | | | | | | |
4141
BreadthFirstSearch | :+1: | :+1: | :+1: | :+1: | | | | | | | | | | | | | |
4242
FloodFill | :+1: | :+1: | :+1: | | | | | | :+1: | | | | | | | | |
4343
LongestIncreasingSubsequence | :+1: | :+1: | :+1: | :+1: | | | | | | | | | | | | | |
4444
UnaryCoding | :+1: | :+1: | :+1: | :+1: | | | | | | | | | | | | | |
4545
QuickSelect | | :+1: | :+1: | :+1: | | :+1: | | | | | | | | | | | |
4646
SieveOfEratosthenes | | :+1: | :+1: | :+1: | | | | | | | :+1: | | | | | | |
47-
BitonicSort | :+1: | :+1: | | | :+1: | | | | | | | | | | | | |
48-
PrimeCheck | :+1: | | :+1: | | :+1: | | | | | | | | | | | | |
47+
BitonicSort | :+1: | | :+1: | | :+1: | | | | | | | | | | | | |
48+
PrimeCheck | :+1: | :+1: | | | :+1: | | | | | | | | | | | | |
4949
SieveofEratosthenes | :+1: | | | | :+1: | | :+1: | | | | | | | | | | |
5050
Swap | | | | | :+1: | :+1: | | | | :+1: | | | | | | | |
5151
UnionFind | | :+1: | :+1: | | :+1: | | | | | | | | | | | | |
5252
BorweinsAlgorithm | :+1: | :+1: | :+1: | | | | | | | | | | | | | | |
53-
CountingInversions | :+1: | :+1: | | | | :+1: | | | | | | | | | | | |
53+
CountingInversions | :+1: | | :+1: | | | :+1: | | | | | | | | | | | |
5454
CycleSort | :+1: | :+1: | :+1: | | | | | | | | | | | | | | |
55-
EditDistance | :+1: | | :+1: | | | | | | :+1: | | | | | | | | |
55+
EditDistance | :+1: | :+1: | | | | | | | :+1: | | | | | | | | |
5656
KnuthMorrisPrath | :+1: | :+1: | :+1: | | | | | | | | | | | | | | |
57-
Permutations | :+1: | | :+1: | :+1: | | | | | | | | | | | | | |
57+
Permutations | :+1: | :+1: | | :+1: | | | | | | | | | | | | | |
5858
RabinKarp | :+1: | :+1: | :+1: | | | | | | | | | | | | | | |
5959
TopologicalSort | :+1: | :+1: | :+1: | | | | | | | | | | | | | | |
60-
DiffieHellman | | | :+1: | | | :+1: | | | | | :+1: | | | | | | |
61-
knapsack | | :+1: | | | :+1: | | | | | | | | | | | | |
62-
AStarSearch | :+1: | | :+1: | | | | | | | | | | | | | | |
63-
BitapAlgorithm | :+1: | | :+1: | | | | | | | | | | | | | | |
64-
CocktailSort | :+1: | :+1: | | | | | | | | | | | | | | | |
65-
ConjugateGradient | :+1: | | :+1: | | | | | | | | | | | | | | |
66-
JohnsonAlgorithm | :+1: | | :+1: | | | | | | | | | | | | | | |
60+
DiffieHellman | | :+1: | | | | :+1: | | | | | :+1: | | | | | | |
61+
knapsack | | | :+1: | | :+1: | | | | | | | | | | | | |
62+
AStarSearch | :+1: | :+1: | | | | | | | | | | | | | | | |
63+
BitapAlgorithm | :+1: | :+1: | | | | | | | | | | | | | | | |
64+
CocktailSort | :+1: | | :+1: | | | | | | | | | | | | | | |
65+
ConjugateGradient | :+1: | :+1: | | | | | | | | | | | | | | | |
66+
JohnsonAlgorithm | :+1: | :+1: | | | | | | | | | | | | | | | |
6767
Knapsack | :+1: | | | :+1: | | | | | | | | | | | | | |
68-
KruskalsAlgorithm | :+1: | :+1: | | | | | | | | | | | | | | | |
69-
LongestPath | :+1: | | :+1: | | | | | | | | | | | | | | |
68+
KruskalsAlgorithm | :+1: | | :+1: | | | | | | | | | | | | | | |
69+
LongestPath | :+1: | :+1: | | | | | | | | | | | | | | | |
7070
Minimax | :+1: | | | | | :+1: | | | | | | | | | | | |
71-
BestFirstSearch | | :+1: | | | | | | :+1: | | | | | | | | | |
71+
BestFirstSearch | | | :+1: | | | | | :+1: | | | | | | | | | |
7272
ConnectedComponentLabeling | | | | | :+1: | | | | | | | | | | | | |
7373
LeakyBucket | | | | | :+1: | | | | | | | | | | | | |
7474
PostmanSort | | | | | :+1: | | | | | | | | | | | | |
@@ -81,6 +81,7 @@ FenwickTree | :+1: | | | | | | | | | | | | | | | |
8181
HeavyLightDecomposition | :+1: | | | | | | | | | | | | | | | | |
8282
InFixToPostFix | :+1: | | | | | | | | | | | | | | | | |
8383
InverseFastFourierTransform | :+1: | | | | | | | | | | | | | | | | |
84+
JosephusProblem | :+1: | | | | | | | | | | | | | | | | |
8485
LongestBitonicSubsequence | :+1: | | | | | | | | | | | | | | | | |
8586
LongestSubsetZeroSum | :+1: | | | | | | | | | | | | | | | | |
8687
MatrixExponentiation | :+1: | | | | | | | | | | | | | | | | |
@@ -96,17 +97,18 @@ StronglyConnectedGraph | :+1: | | | | | | | | | | | | |
9697
TarjansOfflineLCA | :+1: | | | | | | | | | | | | | | | | |
9798
VEGASAlgorithm | :+1: | | | | | | | | | | | | | | | | |
9899
Cocktailshakersort | | | | | | :+1: | | | | | | | | | | | |
99-
DynamicProgramming | | :+1: | | | | | | | | | | | | | | | |
100-
EdmondsKarp | | :+1: | | | | | | | | | | | | | | | |
101-
ElevatorAlgorithm | | :+1: | | | | | | | | | | | | | | | |
102-
HistogramEqualization | | :+1: | | | | | | | | | | | | | | | |
103-
MinMaxABPruning | | :+1: | | | | | | | | | | | | | | | |
104-
PearsonHashing | | :+1: | | | | | | | | | | | | | | | |
105-
RodCuttingAlgorithm | | :+1: | | | | | | | | | | | | | | | |
100+
DynamicProgramming | | | :+1: | | | | | | | | | | | | | | |
101+
EdmondsKarp | | | :+1: | | | | | | | | | | | | | | |
102+
ElevatorAlgorithm | | | :+1: | | | | | | | | | | | | | | |
103+
HistogramEqualization | | | :+1: | | | | | | | | | | | | | | |
104+
MinMaxABPruning | | | :+1: | | | | | | | | | | | | | | |
105+
PearsonHashing | | | :+1: | | | | | | | | | | | | | | |
106+
RodCuttingAlgorithm | | | :+1: | | | | | | | | | | | | | | |
106107
PartialSort | | | | :+1: | | | | | | | | | | | | | |
107-
AhoCorasick | | | :+1: | | | | | | | | | | | | | | |
108-
BloomFilter | | | :+1: | | | | | | | | | | | | | | |
109-
Sumset | | | :+1: | | | | | | | | | | | | | | |
108+
AhoCorasick | | :+1: | | | | | | | | | | | | | | | |
109+
BloomFilter | | :+1: | | | | | | | | | | | | | | | |
110+
Luhn | | :+1: | | | | | | | | | | | | | | | |
111+
Sumset | | :+1: | | | | | | | | | | | | | | | |
110112

111113

112114
[List of Algorithms](Algorithms.md)

0 commit comments

Comments
 (0)