# Algorithms Example

[![DeepScan grade](https://deepscan.io/api/teams/6243/projects/8132/branches/92442/badge/grade.svg)](https://deepscan.io/dashboard#view=project&tid=6243&pid=8132&bid=92442)



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

## Implemented algorithms with languages:





Language | BrainFuck | C | C# | C++ | Crystal | Go | Haskell | Java | JavaScript | Kotlin | Perl | Python | Racket | Ruby | Rust | Scala | Swift|

---|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|

AStar Search |   |   |   | :+1: |   |   |   |   |   |   |   | :+1: |   |   |   |   |  |

Bellman Ford |   |   | :+1: | :+1: |   |   | :+1: | :+1: |   |   |   | :+1: |   |   |   |   |  |

Binary GCD |   |   |   | :+1: |   | :+1: | :+1: | :+1: |   |   |   | :+1: |   |   |   |   |  |

Binary Search |   | :+1: | :+1: | :+1: |   | :+1: |   | :+1: | :+1: | :+1: | :+1: | :+1: |   | :+1: |   |   | :+1:|

Bitap Algorithm |   |   |   | :+1: |   |   |   |   |   |   |   | :+1: |   |   |   |   |  |

Bitonic Sort |   | :+1: |   | :+1: |   |   |   | :+1: |   |   |   |   |   |   |   |   |  |

Bloom Filter |   |   |   |   |   |   |   |   |   |   |   | :+1: |   |   |   |   |  |

Borweins Algorithm |   |   |   | :+1: |   |   |   | :+1: |   |   |   | :+1: |   |   |   |   |  |

Bubble Sort | :+1: | :+1: | :+1: | :+1: |   | :+1: |   | :+1: | :+1: |   | :+1: | :+1: |   | :+1: | :+1: | :+1: | :+1:|

Cocktail Sort |   |   |   | :+1: |   | :+1: |   |   |   |   |   |   |   |   |   |   |  |

Coin Change |   |   |   | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |  |

Conjugate Gradient |   |   |   | :+1: |   |   |   |   |   |   |   | :+1: |   |   |   |   |  |

Connected Component Labeling |   | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |   |   |  |

Count Sort |   |   |   |   |   |   |   |   |   |   |   | :+1: |   |   |   |   |  |

Counting Inversions |   |   |   | :+1: |   | :+1: |   | :+1: |   |   |   |   |   |   |   |   |  |

Counting Sort |   |   |   | :+1: |   |   |   | :+1: | :+1: |   |   | :+1: |   | :+1: |   |   | :+1:|

Cycle Sort |   |   |   | :+1: |   |   |   | :+1: |   |   |   | :+1: |   |   |   |   |  |

Depth First Search |   | :+1: |   | :+1: |   |   |   | :+1: | :+1: |   |   | :+1: |   | :+1: |   |   |  |

Diffie Hellman |   |   |   |   |   | :+1: | :+1: |   |   |   |   | :+1: |   |   |   |   |  |

Dijkstras |   |   | :+1: | :+1: |   | :+1: |   | :+1: | :+1: |   |   | :+1: |   |   |   |   |  |

Doomsday |   |   | :+1: | :+1: |   | :+1: |   | :+1: | :+1: | :+1: |   | :+1: |   | :+1: |   |   | :+1:|

Dynamic Programming |   |   |   |   |   |   |   | :+1: |   |   |   |   |   |   |   |   |  |

Edit Distance |   |   |   | :+1: |   |   |   |   |   |   |   | :+1: |   |   |   |   | :+1:|

Edmonds Karp |   |   |   |   |   |   |   | :+1: |   |   |   |   |   |   |   |   |  |

Elevator Algorithm |   |   |   |   |   |   |   | :+1: |   |   |   |   |   |   |   |   |  |

Extended Euclidean Algorithm |   | :+1: |   |   |   |   |   |   | :+1: |   |   |   |   |   |   |   |  |

Factorial |   | :+1: |   |   |   | :+1: |   | :+1: |   |   |   | :+1: |   |   |   |   |  |

Fast Fourier Transform |   | :+1: |   | :+1: |   |   |   | :+1: | :+1: |   |   | :+1: |   |   |   |   |  |

Fenwick Tree |   |   |   | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |  |

Fibonacci | :+1: | :+1: | :+1: | :+1: |   | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1:|

Fisher Yates Shuffle |   |   | :+1: | :+1: |   | :+1: |   | :+1: | :+1: |   |   | :+1: |   | :+1: |   |   |  |

Flood Fill |   |   |   | :+1: |   |   |   | :+1: |   |   |   | :+1: |   |   |   |   | :+1:|

Floyds Algorithm |   | :+1: |   | :+1: |   | :+1: |   | :+1: |   |   |   | :+1: |   |   |   |   |  |

Greatest Common Divisor |   | :+1: | :+1: | :+1: |   | :+1: |   | :+1: | :+1: | :+1: |   | :+1: |   | :+1: |   | :+1: |  |

Hamming Distance |   | :+1: |   | :+1: |   | :+1: |   | :+1: | :+1: |   |   | :+1: |   | :+1: |   |   |  |

Heap Sort |   | :+1: |   | :+1: | :+1: | :+1: |   | :+1: | :+1: |   |   | :+1: |   | :+1: |   |   |  |

Heavy Light Decomposition |   |   |   | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |  |

Histogram Equalization |   |   |   |   |   |   |   | :+1: |   |   |   |   |   |   |   |   |  |

Insertion Sort |   | :+1: | :+1: | :+1: |   | :+1: |   | :+1: | :+1: | :+1: |   | :+1: |   | :+1: | :+1: | :+1: | :+1:|

Johnson Algorithm |   |   |   | :+1: |   |   |   |   |   |   |   | :+1: |   |   |   |   |  |

Kadanes |   | :+1: | :+1: | :+1: |   | :+1: |   | :+1: | :+1: |   |   | :+1: |   |   |   |   |  |

Knapsack |   | :+1: |   |   |   |   |   | :+1: |   |   |   |   |   |   |   |   |  |

Knuth Morris Prath |   |   |   | :+1: |   |   |   | :+1: |   |   |   | :+1: |   |   |   |   |  |

Kruskals Algorithm |   |   |   | :+1: |   |   |   | :+1: |   |   |   |   |   |   |   |   |  |

Leaky Bucket |   | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |   |   |  |

Linear Search |   | :+1: | :+1: | :+1: |   | :+1: |   | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: |   | :+1: | :+1: | :+1:|

Longest Bitonic Subsequence |   |   |   | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |  |

Longest Common Subsequence |   | :+1: |   | :+1: |   |   |   | :+1: |   |   |   | :+1: |   | :+1: |   |   |  |

Longest Increasing Subsequence |   |   |   | :+1: |   |   |   | :+1: | :+1: |   |   | :+1: |   |   |   |   |  |

Longest Path |   |   |   | :+1: |   |   |   |   |   |   |   | :+1: |   |   |   |   |  |

Longest Subset Zero Sum |   |   |   | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |  |

Matrix Exponentiation |   |   |   | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |  |

Merge Sort |   | :+1: | :+1: | :+1: |   | :+1: | :+1: | :+1: | :+1: |   |   | :+1: |   | :+1: |   | :+1: | :+1:|

Min Max ABPruning |   |   |   |   |   |   |   | :+1: |   |   |   |   |   |   |   |   |  |

Minimax |   |   |   | :+1: |   | :+1: |   |   |   |   |   |   |   |   |   |   |  |

Pearson Hashing |   |   |   |   |   |   |   | :+1: |   |   |   |   |   |   |   |   |  |

Permutations |   |   |   | :+1: |   |   |   |   | :+1: |   |   | :+1: |   |   |   |   |  |

Persistent Data Structures |   |   |   | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |  |

Postman Sort |   | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |   |   |  |

Primality Tests |   | :+1: |   | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |  |

Prims |   |   |   | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |  |

Prufer Code |   |   |   | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |  |

Quick Select |   |   |   |   |   | :+1: |   | :+1: | :+1: |   |   | :+1: |   |   |   |   |  |

Quick Sort |   | :+1: | :+1: | :+1: |   | :+1: | :+1: | :+1: | :+1: | :+1: |   | :+1: |   | :+1: | :+1: |   | :+1:|

Rabin Karp |   |   |   |   |   |   |   | :+1: |   |   |   | :+1: |   |   |   |   |  |

Radix Sort |   | :+1: |   | :+1: |   |   |   | :+1: |   |   |   | :+1: |   |   |   |   |  |

Segment Tree |   |   |   | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |  |

Segmented Sieve |   | :+1: |   |   |   |   |   | :+1: |   |   |   | :+1: |   |   |   |   |  |

Selection Sort |   | :+1: | :+1: | :+1: |   | :+1: |   | :+1: | :+1: |   |   | :+1: |   | :+1: | :+1: | :+1: |  |

Sequence Alignment |   |   |   | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |  |

Shell Sort |   |   |   | :+1: |   |   |   | :+1: | :+1: |   |   | :+1: |   | :+1: |   |   |  |

Sieveof Eratosthenes |   |   | :+1: | :+1: |   |   | :+1: | :+1: | :+1: |   |   | :+1: |   |   |   |   |  |

String To Token |   |   |   | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |  |

Strongly Connected Graph.cpp |   |   |   | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |  |

Swap |   | :+1: | :+1: | :+1: |   |   |   | :+1: | :+1: |   |   | :+1: |   |   |   | :+1: | :+1:|

Tarjans Offline LCA |   |   |   | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |  |

Ternary Search |   | :+1: |   | :+1: |   |   |   | :+1: | :+1: |   |   | :+1: |   |   |   |   |  |

Topological Sort |   |   |   | :+1: |   |   |   | :+1: |   |   |   | :+1: |   |   |   |   |  |

Unary Coding |   |   |   |   |   |   |   | :+1: | :+1: |   |   | :+1: |   |   |   |   |  |

Union Find |   | :+1: |   |   |   |   |   | :+1: |   |   |   | :+1: |   |   |   |   |  |

VEGASAlgorithm |   |   |   | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |  |



[List of Algorithms](Algorithms.md)

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](LICENSE)



## Stargazers over time



[![Stargazers over time](https://starchart.cc/Thuva4/Algorithms.svg)](https://starchart.cc/Thuva4/Algorithms)