This repo contains all existing types of Algorithms implemented in C++
| Searching Technique | Complexity(Worst Case) | Link | Any Other Resource |
|---|---|---|---|
| Linear | O(n) | Linear Search | |
| Binary | O(log n) | Binary Search | |
| Ternary | O(log n) | Ternary Search | |
| Interpolation | O(log log n) | Interpolation Search | Derivation of Formula |
| Jump | O(n ½) | Jump Search |
| Sorting Technique | Complexity(Worst Case) | Link | Method | Stable | Class |
|---|---|---|---|---|---|
| Selection | O(n^2) | Selection Sort | Selection | No | Comparison Sort |
| Insertion | O(n^2) | Insertion Sort | Insertion | Yes | Comparison Sort |
| Counting | O(n + k) | Counting Sort | - | Yes | Non-Comparison Sort |
| Quick | O(n log n) | Quick Sort | Partitioning | No | Comparison Sort |
| Bubble | O(n^2) | Bubble Sort | Exchanging | Yes | Comparison |
| Merge Sort | O(n log n) | Merge Sort | Merging | Yes | - |
| Technique | Complexity(Worst Case) | Link |
|---|---|---|
| Knuth-Morris-Pratt | O(n+m) | KMP |
| Technique | Complexity(Worst Case) | Link |
|---|---|---|
| Fibonacci | O(n) | fibonacci |
| Technique | Complexity(Worst Case) | Link |
|---|---|---|
| Binary Search | O(log n) | Binary Search |
| Quick Sort | O(n log n) | Quick Sort |
| Merge Sort | O(n log n) | Merge Sort |
See CONTRIBUTING file for contributing.
All the Algorithms have been complied using GCC 8.1.0 (MinGW) on a Winodws Machine & GCC 8.2.0 on Ubuntu (Mate) Machine.