ankushsde / algorithms Goto Github PK

This is a continuously updating list of some of the most essential algorithms implemented in pseudocode, C++14, Python 3 and Java. You can find a comprehensive explanation of some of the algorithms present in this repo here:

• https://dev.to/iuliagroza/complete-introduction-to-the-30-most-essential-data-structures-algorithms-43kd
• https://medium.com/marketing-and-entrepreneurship/complete-introduction-to-the-30-most-essential-data-structures-algorithms-5f8090773d21
• https://twitter.com/_iuliagroza

1. Bellman-Ford
2. Binary Search
3. Breadth-First Search (BFS)
4. Bubble Sort
5. Convex Hull
6. Counting Sort
7. Depth-First Search (DFS)
8. Dijkstra
9. Divide & Conquer
10. Dynamic Programming. 0-1 Knapsack Problem
11. Fleury
12. Floyd-Warshall / Roy-Floyd
13. Fractional Knapsack Problem
14. Greedy. Maximum number of non-overlapping intervals on an axis
15. Heap Sort
16. Insertion Sort
17. Kempe
18. Kempe Linear
19. Knuth-Morris-Pratt (KMP)
20. Kruskal
21. Linear Search
22. Longest Common Subsequence
23. Longest Increasing Subsequence
24. Merge Sort
25. Quick Sort
26. Radix Sort
27. Selection Sort
28. Sieve of Erathostenes
29. Topological Sorting

1. Create an issue where you document your contribution (i.e. mention the algorithm you want to develop the source code for, and the programming language).
2. Propose your changes in a new branch with the name <issue_id> <algorithm_name> <programming_language> and create a pull request.
3. [IMPORTANT] Please make sure to be consistent in terms of project/directories structure and style guide!
4. Wait for review & approvals, and be proud of yourself :) Your contribution is highly appreciated!