Basically these are supposed to be my notes, but feel free to use them as you wish to.
Note: Please read CONTRIBUTING.md before making any pull requests
- Ensure that no one is working on (or already completed) the algorithm and language you want to work on
- Use descriptive comit messages
- You can create an issue for the algorithm you want to claim and work on
- FOLLOW THE DIRECTORY STRUCTURE AND NAMING CONVENTION
- UPDATE THE README AS YOU WORK ON A NEW ALGO
- Binary Search
- Breadth First Search
- Depth First Search
- Exponential Search
- Fibonacci Search
- Interpolation Search
- Jump Search
- KMP Search
- Linear Search
- Rabin-Karp Search
- Sublist Search
- Ternary Search
- Bucket Sort
- Bubble Sort
- Cocktail Sort
- Comb Sort
- Counting Sort
- Cycle Sort
- Heap Sort
- Insertion Sort
- Merge Sort
- Pigeonhole Sort
- Quick Sort
- Radix Sort
- Selection Sort
- Shell Sort
- Tim Sort
- Optimised School Method (Check factors till √n)
- Fermat Method
- Miller-Rabin Method
- Sieve of Eratosthenes
- Solovay-Strassen Method