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