saru-d2 / Algorithms

Short explanations and implementations of different algorithms in multiple languages

Algorithms

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

TLDR of contributing.md:

• 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

Types of Algorithms

• Searching
• Sorting
• Primality Test
• Classic algorithms

---

Searching Algorithms

• Binary Search
• Exponential Search
• Fibonacci Search
• Interpolation Search
• Jump Search
• Linear Search
• Sublist Search
• Ternary Search

Sorting Algorithms

• Bucket Sort
• Bubble Sort
• Comb Sort
• Counting Sort
• Cycle Sort
• Heap Sort
• Insertion Sort
• Merge Sort
• Pigeonhole Sort
• Quick Sort
• Radix Sort
• Selection Sort
• Shell Sort

Primality Test

• Optimised School Method (Check factors till √n)
• Fermat Method
• Miller-Rabin Method
• Solovay-Strassen Method

Classic Alogorithms

• Kosaraju's algorithm
• Tries
• 0/1 Knappsack
• Prim's Algorithm
• Sieve Of Eratosthenes
• Lowest Common Ancestor