|
1 | 1 | <div align="center">
|
2 |
| - <img width="400" height="270" src="http://konpa.github.io/devicon/devicon.git/icons/cplusplus/cplusplus-original.svg" alt="C Plus Plus Logo"> |
| 2 | + <img width="400" height="270" src="http://konpa.github.io/devicon/devicon.git/icons/cplusplus/cplusplus-original.svg"> |
3 | 3 | <br>
|
4 | 4 | <br>
|
5 | 5 | <img src="https://cdn.abranhe.com/projects/algorithms/algorithms.svg" width="400px">
|
6 | 6 | <br>
|
7 | 7 | <br>
|
8 |
| - <p>All ▲lgorithms implemented in C Plus Plus</p> |
9 |
| - <a href="https://algorithms.abranhe.com"><img src="https://img.shields.io/badge/All-%E2%96%B2llgorithms-700606.svg"></a> |
| 8 | + <p>All ▲lgorithms implemented in C++</p> |
| 9 | + <a href="https://algorithms.abranhe.com"><img src="https://cdn.abranhe.com/projects/algorithms/badge.svg"></a> |
10 | 10 | <a href="https://github.com/abranhe/algorithms/blob/master/LICENSE"><img src="https://img.shields.io/github/license/abranhe/algorithms.svg" /></a>
|
11 | 11 | <a href="https://cash.me/$abranhe"><img src="https://cdn.abraham.gq/badges/cash-me.svg"></a>
|
12 | 12 | <a href="https://www.patreon.com/abranhe"><img src="https://cdn.abraham.gq/badges/patreon.svg" /></a>
|
|
19 | 19 |
|
20 | 20 | ## Contents
|
21 | 21 |
|
22 |
| -- [Arithmetic Analysis](arithmetic-analysis) |
23 |
| -- [File Transfer Protocol](file-transfer-protocol) |
24 |
| -- [Greedy Algorithms](greedy-algorithms) |
25 |
| -- [Graphs](graphs) |
26 |
| -- [Math](math) |
27 |
| -- [Neutral Network](neutral-network) |
28 |
| -- [Ciphers](ciphers) |
29 |
| -- [Data Structures](data-structures) |
30 |
| -- [Dynamic Programming](dynamic-programming) |
31 |
| -- [Hashes](hashes) |
32 |
| -- [Searches](searches) |
33 |
| -- [Sorting](sorting) |
34 |
| -- [Strings](strings) |
35 |
| -- [Traversals](traversals) |
| 22 | +- [Artificial Intelligence](#artificial-intelligence) |
| 23 | +- [Backtracking](#backtracking) |
| 24 | +- [Bit Manipulation](#bit-manipulation) |
| 25 | +- [Cellular Automaton](#cellular-automaton) |
| 26 | +- [Ciphers](#ciphers) |
| 27 | +- [Computational Geometry](#computational-geometry) |
| 28 | +- [Cryptography](#cryptography) |
| 29 | +- [Data Structures](#data-structures) |
| 30 | +- [Divide and conquer](#divide-and-conquer) |
| 31 | +- [Dynamic Programming](#dynamic-programming) |
| 32 | +- [Gaming Theory](#gaming-theory) |
| 33 | +- [Graphs](#graphs) |
| 34 | +- [Greedy Algorithms](#greedy-algorithms) |
| 35 | +- [Math](#math) |
| 36 | +- [Networking](#networking) |
| 37 | +- [Numerical Analysis](#numerical-analysis) |
| 38 | +- [Operating system](#operating-system) |
| 39 | +- [Randomized Algorithms](#randomized-algorithms) |
| 40 | +- [Searches](#searches) |
| 41 | +- [Selections Algorithms](#selections-algorithms) |
| 42 | +- [Sorting](#sorting) |
| 43 | +- [Strings](#strings) |
| 44 | +- [Online Challenges](#online-challenges) |
| 45 | +- [Others](#others) |
| 46 | + |
| 47 | +## Data Structures |
| 48 | + |
| 49 | +- Queue |
| 50 | + - [Circular Buffer](data-structures/queue/circular_buffer.cpp) |
| 51 | + - [Queue](data-structures/queue/queue.cpp) |
| 52 | +- Stack |
| 53 | + - [Stack](data-structures/stack/stack.cpp) |
| 54 | + |
| 55 | +## Dynamic Programming |
| 56 | + |
| 57 | +- [Coin Change](dynamic-programming/coin_change.cpp) |
| 58 | +- [Edit Distance](dynamic-programming/edit_distance.cpp) |
| 59 | +- [Knapsack](dynamic-programming/knapsack.cpp) |
| 60 | +- [Longest common subsequence](dynamic-programming/lcs.cpp) |
| 61 | +- [Longest Path](dynamic-programming/longest_path.cpp) |
| 62 | +- [Ways to Cover](dynamic-programming/ways_to_cover.cpp) |
| 63 | + |
| 64 | +## Graphs |
| 65 | + |
| 66 | +- [Bellman Ford](graphs/bellman_ford.cpp) |
| 67 | +- [Breadth-first search](graphs/bfs.cpp) |
| 68 | +- [Count Disconnected Components](graphs/count_disconnected_components.cpp) |
| 69 | +- [Depth-first search](graphs/dfs.cpp) |
| 70 | +- [Dijkstra](graphs/dijkstra.cpp) |
| 71 | +- [Floyed Warshall](graphs/floyd_warshall.cpp) |
| 72 | +- [Prims Adjacency List](graphs/prims_adjacency_list.cpp) |
| 73 | + |
| 74 | +## Math |
| 75 | + |
| 76 | +- [Collatz](math/collatz.cpp) |
| 77 | +- [Euclids Greatest common divisor](math/euclids_gcd.cpp) |
| 78 | +- [Factorial](math/factorial.cpp) |
| 79 | +- [Greatest common divisor of array](math/gcd_of_array.cpp) |
| 80 | +- [Least common multiple of array](math/lcm_of_array.cpp) |
| 81 | +- [Lucky Numbers](math/lucky_numbers.cpp) |
| 82 | +- [Modular Exponentiations](math/modular_exponentiations.cpp) |
| 83 | + |
| 84 | +## Searches |
| 85 | + |
| 86 | +- [Binary Search](searches/binary_search.cpp) |
| 87 | +- [Jump Search](searches/jump_search.cpp) |
| 88 | +- [Linear Search](searches/linear_search.cpp) |
| 89 | + |
| 90 | +## Sorting |
| 91 | + |
| 92 | +- [Bubble Sort](sorting/bubble_sort.cpp) |
| 93 | +- [Heap Sort](sorting/heap_sort.cpp) |
| 94 | +- [Insertion Sort](sorting/insertion_sort.cpp) |
| 95 | +- [Merge Sort](sorting/merge_sort.cpp) |
| 96 | +- [Quick Sort](sorting/quick_sort.cpp) |
| 97 | +- [Selection Sort](sorting/selection_sort.cpp) |
| 98 | +- [Sort Vector](sorting/sort_vector.cpp) |
| 99 | + |
| 100 | +## Strings |
| 101 | + |
| 102 | +- [Anagram Check](strings/anagram_check.cpp) |
| 103 | +- [Lexicographic Ranking](strings/lexicographic_ranking.cpp) |
| 104 | +- [Longest Palindrome Subset](strings/longest_palindrome_subset.cpp) |
| 105 | +- [Naive Search](strings/naive_search.cpp) |
| 106 | +- [Permutations of string](strings/permutations_of_string.cpp) |
| 107 | +- [Print duplicate string](strings/print_duplicate_string.cpp) |
| 108 | +- [Rabin Karp](strings/rabin_karp.cpp) |
| 109 | +- [Remove Adjacent Duplicates](strings/remove_adjacent_duplicates.cpp) |
| 110 | +- [Remove Duplicates](strings/remove_duplicates.cpp) |
| 111 | +- [Reverse String](strings/reverse_string.cpp) |
36 | 112 |
|
37 | 113 | ## License
|
38 | 114 |
|
39 | 115 | This work is licensed under a [MIT License](https://github.com/abranhe/algorithms/blob/master/LICENSE)
|
40 | 116 |
|
41 |
| -[![MIT IMG][mit-license]]((https://github.com/abranhe/algorithms/blob/master/LICENSE)) |
| 117 | +[](https://github.com/abranhe/algorithms/blob/master/LICENSE) |
42 | 118 |
|
43 | 119 | To the extent possible under law, [Carlos Abraham](https://go.abranhe.com/github) has waived all copyright and related or neighboring rights to this work.
|
44 | 120 |
|
45 | 121 |
|
46 |
| -[mit-license]: https://cdn.abraham.gq/projects/algorithms/mit-license.png |
| 122 | +<div align="center"> |
| 123 | + <a href="https://github.com/abranhe/algorithms"> |
| 124 | + <img src="https://cdn.abranhe.com/projects/algorithms/logo.svg" width="50px"> |
| 125 | + </a> |
| 126 | + <br> |
| 127 | +</div> |
0 commit comments