Make some algorithms in differents languages, about the issues.
| Algorithm | Code |
|
|
|
|
2
|
3
|
|
|
|
|---|---|---|---|---|---|---|---|---|---|---|
| minimun in array | ar-min |
done | ||||||||
| Bin Sort | ar-binsrt |
|||||||||
| Binary Search | ar-bsrh |
done | done | done | ||||||
| Breadth First Search | gr-bfsrh |
|||||||||
| Bubble Sort | ar-bsrt |
done | done | |||||||
| Coin Change Problem | ar-cochprb |
|||||||||
| Depth First Search | gr-dfsrh |
|||||||||
| Dijkstra Algorithm | gr-dij |
|||||||||
| Exponentiation by Squaring | ar-expsq |
|||||||||
| Heap Sort | ar-hsrt |
|||||||||
| Insertion Sort | ar-isrt |
done | ||||||||
| Knuth–Morris–Pratt | ar-kmp |
|||||||||
| K-NN | ar-knn |
|||||||||
| Largest Sum Contiguous Sub-Array | ar-lscsa |
|||||||||
| Linear Regression | ar-lreg |
|||||||||
| Linear Search | ar-lsrh |
|||||||||
| Longest Common Subsequence | ar-lcs |
|||||||||
| Longest Increasing Subsequence | ar-lis |
|||||||||
| Longest Palindromic Substring | ar-lps |
Done | ||||||||
| Merge Sort | ar-msrt |
Done | done | |||||||
| Modular Exponential | ar-mexp |
|||||||||
| Naive Search | ar-nsrh |
|||||||||
| Prime Factor | ar-prfac |
|||||||||
| Prims | gr-prims |
done | done | |||||||
| Quick Select | ar-qsel |
|||||||||
| Quick Sort | ar-qsrt |
|||||||||
| Radix Sort | ar-radsrt |
|||||||||
| Rod Cutting Problem | ar-rcprb |
|||||||||
| Selection Sort | ar-ssrt |
done | done | done | ||||||
| Shell Sort | ar-shsrt |
|||||||||
| Sieve of Eratosthenes | ar-soer |
|||||||||
| Sleep Sort | ar-slpsrt |
done |