๐ŸŒ AIๆœ็ดข & ไปฃ็† ไธป้กต
Skip to content

thuva4/Algorithms

Folders and files

NameName
Last commit message
Last commit date

Latest commit

ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 

Algorithms Example

DeepScan grade

This repository contains examples of various algorithms which were written on different programming languages.

Implemented algorithms with languages:

Language C++ Python Java JavaScript C Go C# Ruby Swift Scala Haskell Kotlin Rust Perl BrainFuck Crystal Racket
Fibonacci ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘
BubbleSort ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘
LinearSearch ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘
InsertionSort ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘
QuickSort ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘
BinarySearch ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘
MergeSort ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘
GreatestCommonDivisor ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘
SelectionSort ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘
Doomsday ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘
HeapSort ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘
XorSwap ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘
Factorial ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘
HammingDistance ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘
Kadanes ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘
FisherYatesShuffle ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘
LongestCommonSubsequence ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘
Dijkstras ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘
CountingSort ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘
DepthFirstSearch ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘
FastFourierTransform ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘
FloydsAlgorithm ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘
RadixSort ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘
TernarySearch ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘
BellmanFord ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘
BinaryGCD ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘
ShellSort ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘
ExtendedEuclidean ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘
SegmentedSieve ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘
BreadthFirstSearch ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘
FloodFill ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘
LongestIncreasingSubsequence ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘
UnaryCoding ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘
QuickSelect ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘
SieveOfEratosthenes ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘
BitonicSort ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘
PrimeCheck ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘
SieveofEratosthenes ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘
Swap ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘
UnionFind ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘
BorweinsAlgorithm ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘
CountingInversions ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘
CycleSort ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘
EditDistance ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘
KnuthMorrisPrath ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘
Permutations ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘
RabinKarp ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘
TopologicalSort ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘
DiffieHellman ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ‘
knapsack ๐Ÿ‘ ๐Ÿ‘
AStarSearch ๐Ÿ‘ ๐Ÿ‘
BitapAlgorithm ๐Ÿ‘ ๐Ÿ‘
CocktailSort ๐Ÿ‘ ๐Ÿ‘
ConjugateGradient ๐Ÿ‘ ๐Ÿ‘
JohnsonAlgorithm ๐Ÿ‘ ๐Ÿ‘
Knapsack ๐Ÿ‘ ๐Ÿ‘
KruskalsAlgorithm ๐Ÿ‘ ๐Ÿ‘
LongestPath ๐Ÿ‘ ๐Ÿ‘
Minimax ๐Ÿ‘ ๐Ÿ‘
BestFirstSearch ๐Ÿ‘ ๐Ÿ‘
ConnectedComponentLabeling ๐Ÿ‘
LeakyBucket ๐Ÿ‘
PostmanSort ๐Ÿ‘
BinaryTree ๐Ÿ‘
CoinChange ๐Ÿ‘
Combination ๐Ÿ‘
DungeonGame ๐Ÿ‘
EulerToient ๐Ÿ‘
FenwickTree ๐Ÿ‘
HeavyLightDecomposition ๐Ÿ‘
InFixToPostFix ๐Ÿ‘
InverseFastFourierTransform ๐Ÿ‘
JosephusProblem ๐Ÿ‘
LongestBitonicSubsequence ๐Ÿ‘
LongestSubsetZeroSum ๐Ÿ‘
MatrixExponentiation ๐Ÿ‘
ModifiedBinarySearch ๐Ÿ‘
PersistentDataStructures ๐Ÿ‘
PrimalityTests ๐Ÿ‘
Prims ๐Ÿ‘
PruferCode ๐Ÿ‘
SegmentTree ๐Ÿ‘
SequenceAlignment ๐Ÿ‘
StringToToken ๐Ÿ‘
StronglyConnectedGraph ๐Ÿ‘
TarjansOfflineLCA ๐Ÿ‘
VEGASAlgorithm ๐Ÿ‘
Cocktailshakersort ๐Ÿ‘
DynamicProgramming ๐Ÿ‘
EdmondsKarp ๐Ÿ‘
ElevatorAlgorithm ๐Ÿ‘
HistogramEqualization ๐Ÿ‘
MinMaxABPruning ๐Ÿ‘
PearsonHashing ๐Ÿ‘
RodCuttingAlgorithm ๐Ÿ‘
PartialSort ๐Ÿ‘
AhoCorasick ๐Ÿ‘
BloomFilter ๐Ÿ‘
Luhn ๐Ÿ‘
Sumset ๐Ÿ‘

List of Algorithms

Folder structure should be like this [language]/[Algorithm name]/file For example:

  • Go/BubbleSort/BubbleSort.go
  • C++/QuickSort/QuickSort.cpp

License

Apache License 2.0

Releases

No releases published

Packages

No packages published

Contributors 221