Make some algorithms in differents languages, about the issues. How it's work ?
- Create some issues for one algorithm.
- Fork the repos, make it and create a Pull Request
- Add your name in contributor
- Update readme with done in right colomn
Drop a ⭐ on the Github repository
Algorithm | Code | 2 | 3 | other language | |||||||
---|---|---|---|---|---|---|---|---|---|---|---|
A* algorithm | Searching |
Done | Done | DONE | |||||||
Minimum in array | ar-min |
Done | Done | Done | Done | Done | Done | Done | Done | Done | |
Best First Search algorithm | Searching |
Done | |||||||||
Bin Sort | ar-binsrt |
Done | Done | Done | Done | Done | Done | ||||
Bucket Sort | bucket_sort |
Done | Done | Done | Done | ||||||
Boyer Moore's Algorithm | ar-bm |
Done | Done | ||||||||
Breadth First Search | gr-bfsrh |
Done | Done | Done | Done | Done | |||||
Bogosort | ar-bogosort |
Done | Done | Done | Done | Done | Done | ||||
Bubble Sort | ar-bsrt |
Done | Done | Done | Done | Done | Done | Done | Done | Done | |
Bucket Sort | ar-bsrt |
Done | Done | ||||||||
Coin Change Problem | ar-cochprb |
Done | Done | Done | Done | Done | Done | ||||
Depth First Search | gr-dfsrh |
Done | Done | Done | Done | Done | |||||
Dijkstra Algorithm | gr-dij |
Done | Done | Done | Done | ||||||
Exponentiation by Squaring | ar-expsq |
Done | Done | Done | |||||||
Heap Sort | ar-hsrt |
Done | Done | Done | Done | Done | Done | ||||
Insertion Sort | ar-isrt |
Done | Done | Done | Done | Done | Done | Done | Done | ||
Kadane's Algorithm | ar-kdn |
Done | Done | Done | Done | Done | |||||
Knuth-Morris-Pratt | ar-kmp |
Done | Done | Done | Done | ||||||
K-NN | ar-knn |
Done | Done | ||||||||
Largest Sum Contiguous Sub-Array | ar-lscsa |
Done | Done | Done | |||||||
Linear Search | ar-lsrh |
Done | Done | Done | Done | Done | |||||
Longest Common Subsequence | ar-lcs |
Done | Done | Done | Done | Done | |||||
Longest Increasing Subsequence | ar-lis |
Done | Done | Done | Done | ||||||
Longest Palindromic Substring | ar-lps |
Done | Done | Done | |||||||
Merge Sort | ar-msrt |
Done | Done | Done | Done | Done | Done | Done | |||
Min-Max algorithm | algorithms |
Done | Done | ||||||||
Modular Exponential | ar-mexp |
Done | Done | Done | Done | ||||||
Naive Search | ar-nsrh |
Done | Done | Done | |||||||
N Queens | n_queens.cpp |
Done | Done | ||||||||
Pigeonhole Sort algorithm | ar-.... |
Done | |||||||||
Prime Factor | ar-prfac |
Done | Done | Done | Done | Done | Done | ||||
Prims | gr-prims |
Done | Done | Done | |||||||
Quick Select | ar-qsel |
Done | Done | Done | Done | ||||||
Quick Sort | ar-qsrt |
Done | Done | Done | Done | Done | Done | ||||
Radix Sort | ar-radsrt |
Done | Done | Done | Done | ||||||
Rod Cutting Problem | ar-rcprb |
Done | |||||||||
Selection Sort | ar-ssrt |
Done | Done | Done | Done | Done | Done | ||||
Shell Sort | ar-shsrt |
Done | Done | Done | Done | ||||||
Sieve of Erastosthenes | ar-soer |
Done | Done | Done | Done | ||||||
Sleep Sort | ar-slpsrt |
Done | Done | Done | Done | Done | |||||
Spiral Matrix | ar-spmat |
Done | Done | Done | |||||||
Count Sort | ar-csrt |
Done | Done | Done | Done | ||||||
Evaluate Postfix Expression | ar-pstfix |
Done | Done | Done | |||||||
Topological Sort | toposort.cpp |
Done | Done | ||||||||
Z function | ar-zfnc |
Done | Done | ||||||||
Bogosort | Bogosort |
Done | |||||||||
Red Blacktree | ar-rbtree |
Done | |||||||||
Rock Paper Scissor | ar-rpprscs |
Done | Done | Done | Done | Done | Done | ||||
Greedy Algorithm | ar-grdy |
Done | Done | ||||||||
String Hashing | ar-strhsg |
Done | |||||||||
Left View Binary Tree | ar-lvwbintr |
Done | Done | ||||||||
Top View Binary Tree | ar-tvwbintr |
Done | Done | Done | |||||||
Right View Binary Tree | rightview |
Done | |||||||||
Bottom View Binary Tree | ar-bvwbintr |
Done | Done |
follow this model
Added [XXX] algorithm in the good folder.
- added [XXX] algorithm.
- updated readme.