|
5 | 5 | * [newton method](https://github.com/TheAlgorithms/Python/blob/master/arithmetic_analysis/newton_method.py) |
6 | 6 | * [newton raphson method](https://github.com/TheAlgorithms/Python/blob/master/arithmetic_analysis/newton_raphson_method.py) |
7 | 7 | ## Backtracking |
| 8 | + * [all combinations](https://github.com/TheAlgorithms/Python/blob/master/backtracking/all_combinations.py) |
8 | 9 | * [all permutations](https://github.com/TheAlgorithms/Python/blob/master/backtracking/all_permutations.py) |
9 | 10 | * [all subsequences](https://github.com/TheAlgorithms/Python/blob/master/backtracking/all_subsequences.py) |
10 | 11 | * [minimax](https://github.com/TheAlgorithms/Python/blob/master/backtracking/minimax.py) |
|
27 | 28 | * [morse code implementation](https://github.com/TheAlgorithms/Python/blob/master/ciphers/morse_code_implementation.py) |
28 | 29 | * [onepad cipher](https://github.com/TheAlgorithms/Python/blob/master/ciphers/onepad_cipher.py) |
29 | 30 | * [playfair cipher](https://github.com/TheAlgorithms/Python/blob/master/ciphers/playfair_cipher.py) |
30 | | - * [prehistoric men](https://github.com/TheAlgorithms/Python/blob/master/ciphers/prehistoric_men.txt) |
31 | 31 | * [rabin miller](https://github.com/TheAlgorithms/Python/blob/master/ciphers/rabin_miller.py) |
32 | 32 | * [rot13](https://github.com/TheAlgorithms/Python/blob/master/ciphers/rot13.py) |
33 | 33 | * [rsa cipher](https://github.com/TheAlgorithms/Python/blob/master/ciphers/rsa_cipher.py) |
|
39 | 39 | * [vigenere cipher](https://github.com/TheAlgorithms/Python/blob/master/ciphers/vigenere_cipher.py) |
40 | 40 | * [xor cipher](https://github.com/TheAlgorithms/Python/blob/master/ciphers/xor_cipher.py) |
41 | 41 | ## Compression |
| 42 | + * [burrows wheeler](https://github.com/TheAlgorithms/Python/blob/master/compression/burrows_wheeler.py) |
42 | 43 | * [huffman](https://github.com/TheAlgorithms/Python/blob/master/compression/huffman.py) |
43 | 44 | * [peak signal to noise ratio](https://github.com/TheAlgorithms/Python/blob/master/compression/peak_signal_to_noise_ratio.py) |
44 | 45 | * Image Data |
|
100 | 101 | ## Dynamic Programming |
101 | 102 | * [abbreviation](https://github.com/TheAlgorithms/Python/blob/master/dynamic_programming/abbreviation.py) |
102 | 103 | * [bitmask](https://github.com/TheAlgorithms/Python/blob/master/dynamic_programming/bitmask.py) |
| 104 | + * [climbing stairs](https://github.com/TheAlgorithms/Python/blob/master/dynamic_programming/climbing_stairs.py) |
103 | 105 | * [coin change](https://github.com/TheAlgorithms/Python/blob/master/dynamic_programming/coin_change.py) |
104 | 106 | * [edit distance](https://github.com/TheAlgorithms/Python/blob/master/dynamic_programming/edit_distance.py) |
| 107 | + * [factorial](https://github.com/TheAlgorithms/Python/blob/master/dynamic_programming/factorial.py) |
105 | 108 | * [fast fibonacci](https://github.com/TheAlgorithms/Python/blob/master/dynamic_programming/fast_fibonacci.py) |
106 | 109 | * [fibonacci](https://github.com/TheAlgorithms/Python/blob/master/dynamic_programming/fibonacci.py) |
107 | 110 | * [floyd warshall](https://github.com/TheAlgorithms/Python/blob/master/dynamic_programming/floyd_warshall.py) |
|
142 | 145 | * [eulerian path and circuit for undirected graph](https://github.com/TheAlgorithms/Python/blob/master/graphs/eulerian_path_and_circuit_for_undirected_graph.py) |
143 | 146 | * [even tree](https://github.com/TheAlgorithms/Python/blob/master/graphs/even_tree.py) |
144 | 147 | * [finding bridges](https://github.com/TheAlgorithms/Python/blob/master/graphs/finding_bridges.py) |
145 | | - * [floyd warshall](https://github.com/TheAlgorithms/Python/blob/master/graphs/floyd_warshall.py) |
146 | 148 | * [graph list](https://github.com/TheAlgorithms/Python/blob/master/graphs/graph_list.py) |
147 | 149 | * [graph matrix](https://github.com/TheAlgorithms/Python/blob/master/graphs/graph_matrix.py) |
| 150 | + * [graphs floyd warshall](https://github.com/TheAlgorithms/Python/blob/master/graphs/graphs_floyd_warshall.py) |
148 | 151 | * [kahns algorithm long](https://github.com/TheAlgorithms/Python/blob/master/graphs/kahns_algorithm_long.py) |
149 | 152 | * [kahns algorithm topo](https://github.com/TheAlgorithms/Python/blob/master/graphs/kahns_algorithm_topo.py) |
150 | 153 | * [minimum spanning tree kruskal](https://github.com/TheAlgorithms/Python/blob/master/graphs/minimum_spanning_tree_kruskal.py) |
|
170 | 173 | * [knn sklearn](https://github.com/TheAlgorithms/Python/blob/master/machine_learning/knn_sklearn.py) |
171 | 174 | * [linear regression](https://github.com/TheAlgorithms/Python/blob/master/machine_learning/linear_regression.py) |
172 | 175 | * [logistic regression](https://github.com/TheAlgorithms/Python/blob/master/machine_learning/logistic_regression.py) |
| 176 | + * [NaiveBayes](https://github.com/TheAlgorithms/Python/blob/master/machine_learning/NaiveBayes.ipynb) |
173 | 177 | * [perceptron](https://github.com/TheAlgorithms/Python/blob/master/machine_learning/perceptron.py) |
| 178 | + * [reuters one vs rest classifier](https://github.com/TheAlgorithms/Python/blob/master/machine_learning/reuters_one_vs_rest_classifier.ipynb) |
174 | 179 | * [scoring functions](https://github.com/TheAlgorithms/Python/blob/master/machine_learning/scoring_functions.py) |
175 | 180 | * Random Forest Classification |
176 | 181 | * [random forest classification](https://github.com/TheAlgorithms/Python/blob/master/machine_learning/random_forest_classification/random_forest_classification.py) |
| 182 | + * [random forest classifier](https://github.com/TheAlgorithms/Python/blob/master/machine_learning/random_forest_classification/random_forest_classifier.ipynb) |
177 | 183 | * [Social Network Ads](https://github.com/TheAlgorithms/Python/blob/master/machine_learning/random_forest_classification/Social_Network_Ads.csv) |
178 | 184 | * Random Forest Regression |
179 | 185 | * [Position Salaries](https://github.com/TheAlgorithms/Python/blob/master/machine_learning/random_forest_regression/Position_Salaries.csv) |
| 186 | + * [random forest regression](https://github.com/TheAlgorithms/Python/blob/master/machine_learning/random_forest_regression/random_forest_regression.ipynb) |
180 | 187 | * [random forest regression](https://github.com/TheAlgorithms/Python/blob/master/machine_learning/random_forest_regression/random_forest_regression.py) |
181 | 188 | ## Maths |
182 | 189 | * [3n+1](https://github.com/TheAlgorithms/Python/blob/master/maths/3n+1.py) |
|
197 | 204 | * [find max](https://github.com/TheAlgorithms/Python/blob/master/maths/find_max.py) |
198 | 205 | * [find min](https://github.com/TheAlgorithms/Python/blob/master/maths/find_min.py) |
199 | 206 | * [greater common divisor](https://github.com/TheAlgorithms/Python/blob/master/maths/greater_common_divisor.py) |
200 | | - * [lucas series](https://github.com/TheAlgorithms/Python/blob/master/maths/lucas%20series.py) |
| 207 | + * [lucas series](https://github.com/TheAlgorithms/Python/blob/master/maths/lucas_series.py) |
201 | 208 | * [modular exponential](https://github.com/TheAlgorithms/Python/blob/master/maths/modular_exponential.py) |
202 | 209 | * [newton raphson](https://github.com/TheAlgorithms/Python/blob/master/maths/newton_raphson.py) |
203 | 210 | * [prime check](https://github.com/TheAlgorithms/Python/blob/master/maths/prime_check.py) |
|
208 | 215 | * [volume](https://github.com/TheAlgorithms/Python/blob/master/maths/volume.py) |
209 | 216 | ## Matrix |
210 | 217 | * [matrix operation](https://github.com/TheAlgorithms/Python/blob/master/matrix/matrix_operation.py) |
| 218 | + * [nth fibonacci using matrix exponentiation](https://github.com/TheAlgorithms/Python/blob/master/matrix/nth_fibonacci_using_matrix_exponentiation.py) |
| 219 | + * [rotate matrix](https://github.com/TheAlgorithms/Python/blob/master/matrix/rotate_matrix.py) |
211 | 220 | * [searching in sorted matrix](https://github.com/TheAlgorithms/Python/blob/master/matrix/searching_in_sorted_matrix.py) |
212 | 221 | * [spiral print](https://github.com/TheAlgorithms/Python/blob/master/matrix/spiral_print.py) |
213 | 222 | ## Networking Flow |
|
216 | 225 | ## Neural Network |
217 | 226 | * [back propagation neural network](https://github.com/TheAlgorithms/Python/blob/master/neural_network/back_propagation_neural_network.py) |
218 | 227 | * [convolution neural network](https://github.com/TheAlgorithms/Python/blob/master/neural_network/convolution_neural_network.py) |
| 228 | + * [fully connected neural network](https://github.com/TheAlgorithms/Python/blob/master/neural_network/fully_connected_neural_network.ipynb) |
219 | 229 | * [perceptron](https://github.com/TheAlgorithms/Python/blob/master/neural_network/perceptron.py) |
220 | 230 | ## Other |
221 | 231 | * [anagrams](https://github.com/TheAlgorithms/Python/blob/master/other/anagrams.py) |
222 | 232 | * [binary exponentiation](https://github.com/TheAlgorithms/Python/blob/master/other/binary_exponentiation.py) |
223 | 233 | * [binary exponentiation 2](https://github.com/TheAlgorithms/Python/blob/master/other/binary_exponentiation_2.py) |
224 | 234 | * [detecting english programmatically](https://github.com/TheAlgorithms/Python/blob/master/other/detecting_english_programmatically.py) |
225 | | - * [dictionary](https://github.com/TheAlgorithms/Python/blob/master/other/dictionary.txt) |
226 | 235 | * [euclidean gcd](https://github.com/TheAlgorithms/Python/blob/master/other/euclidean_gcd.py) |
227 | 236 | * [finding primes](https://github.com/TheAlgorithms/Python/blob/master/other/finding_primes.py) |
228 | 237 | * [fischer yates shuffle](https://github.com/TheAlgorithms/Python/blob/master/other/fischer_yates_shuffle.py) |
| 238 | + * [Food wastage analysis from 1961-2013 (FAO)](https://github.com/TheAlgorithms/Python/blob/master/other/Food%20wastage%20analysis%20from%201961-2013%20(FAO).ipynb) |
229 | 239 | * [frequency finder](https://github.com/TheAlgorithms/Python/blob/master/other/frequency_finder.py) |
230 | 240 | * [game of life](https://github.com/TheAlgorithms/Python/blob/master/other/game_of_life.py) |
231 | 241 | * [linear congruential generator](https://github.com/TheAlgorithms/Python/blob/master/other/linear_congruential_generator.py) |
|
238 | 248 | * [two sum](https://github.com/TheAlgorithms/Python/blob/master/other/two_sum.py) |
239 | 249 | * [word patterns](https://github.com/TheAlgorithms/Python/blob/master/other/word_patterns.py) |
240 | 250 | * [words](https://github.com/TheAlgorithms/Python/blob/master/other/words) |
241 | | - * Pycache |
242 | | - * [password generator.cpython-37](https://github.com/TheAlgorithms/Python/blob/master/other/__pycache__/password_generator.cpython-37.pyc) |
243 | 251 | ## Project Euler |
244 | 252 | * Problem 01 |
245 | 253 | * [sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_01/sol1.py) |
|
281 | 289 | * [sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_10/sol1.py) |
282 | 290 | * [sol2](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_10/sol2.py) |
283 | 291 | * Problem 11 |
284 | | - * [grid](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_11/grid.txt) |
285 | 292 | * [sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_11/sol1.py) |
286 | 293 | * [sol2](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_11/sol2.py) |
287 | 294 | * Problem 12 |
288 | 295 | * [sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_12/sol1.py) |
289 | 296 | * [sol2](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_12/sol2.py) |
290 | 297 | * Problem 13 |
291 | | - * [num](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_13/num.txt) |
292 | 298 | * [sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_13/sol1.py) |
293 | | - * [sol2](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_13/sol2.py) |
294 | 299 | * Problem 14 |
295 | 300 | * [sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_14/sol1.py) |
296 | 301 | * [sol2](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_14/sol2.py) |
|
309 | 314 | * Problem 21 |
310 | 315 | * [sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_21/sol1.py) |
311 | 316 | * Problem 22 |
312 | | - * [p022 names](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_22/p022_names.txt) |
313 | 317 | * [sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_22/sol1.py) |
314 | 318 | * [sol2](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_22/sol2.py) |
315 | 319 | * Problem 234 |
|
337 | 341 | * [sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_53/sol1.py) |
338 | 342 | * Problem 76 |
339 | 343 | * [sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_76/sol1.py) |
340 | | -## Scripts |
341 | | - * [build directory md](https://github.com/TheAlgorithms/Python/blob/master/scripts/build_directory_md.py) |
342 | 344 | ## Searches |
343 | 345 | * [binary search](https://github.com/TheAlgorithms/Python/blob/master/searches/binary_search.py) |
344 | 346 | * [interpolation search](https://github.com/TheAlgorithms/Python/blob/master/searches/interpolation_search.py) |
|
347 | 349 | * [quick select](https://github.com/TheAlgorithms/Python/blob/master/searches/quick_select.py) |
348 | 350 | * [sentinel linear search](https://github.com/TheAlgorithms/Python/blob/master/searches/sentinel_linear_search.py) |
349 | 351 | * [tabu search](https://github.com/TheAlgorithms/Python/blob/master/searches/tabu_search.py) |
350 | | - * [tabu test data](https://github.com/TheAlgorithms/Python/blob/master/searches/tabu_test_data.txt) |
351 | 352 | * [ternary search](https://github.com/TheAlgorithms/Python/blob/master/searches/ternary_search.py) |
352 | 353 | ## Sorts |
353 | 354 | * [bitonic sort](https://github.com/TheAlgorithms/Python/blob/master/sorts/bitonic_sort.py) |
|
0 commit comments