2019-06-17 10:17:53 +00:00
## Arithmetic Analysis
* [bisection ](https://github.com/TheAlgorithms/Python/blob/master/arithmetic_analysis/bisection.py )
* [intersection ](https://github.com/TheAlgorithms/Python/blob/master/arithmetic_analysis/intersection.py )
* [lu decomposition ](https://github.com/TheAlgorithms/Python/blob/master/arithmetic_analysis/lu_decomposition.py )
* [newton method ](https://github.com/TheAlgorithms/Python/blob/master/arithmetic_analysis/newton_method.py )
* [newton raphson method ](https://github.com/TheAlgorithms/Python/blob/master/arithmetic_analysis/newton_raphson_method.py )
2019-07-13 19:50:37 +00:00
## Backtracking
2019-07-20 07:36:55 +00:00
* [all combinations ](https://github.com/TheAlgorithms/Python/blob/master/backtracking/all_combinations.py )
2019-07-13 19:50:37 +00:00
* [all permutations ](https://github.com/TheAlgorithms/Python/blob/master/backtracking/all_permutations.py )
* [all subsequences ](https://github.com/TheAlgorithms/Python/blob/master/backtracking/all_subsequences.py )
* [minimax ](https://github.com/TheAlgorithms/Python/blob/master/backtracking/minimax.py )
* [n queens ](https://github.com/TheAlgorithms/Python/blob/master/backtracking/n_queens.py )
* [sum of subsets ](https://github.com/TheAlgorithms/Python/blob/master/backtracking/sum_of_subsets.py )
2019-06-17 10:17:53 +00:00
## Boolean Algebra
* [quine mc cluskey ](https://github.com/TheAlgorithms/Python/blob/master/boolean_algebra/quine_mc_cluskey.py )
## Ciphers
* [affine cipher ](https://github.com/TheAlgorithms/Python/blob/master/ciphers/affine_cipher.py )
2019-07-13 19:50:37 +00:00
* [atbash ](https://github.com/TheAlgorithms/Python/blob/master/ciphers/atbash.py )
2019-06-17 10:17:53 +00:00
* [base16 ](https://github.com/TheAlgorithms/Python/blob/master/ciphers/base16.py )
* [base32 ](https://github.com/TheAlgorithms/Python/blob/master/ciphers/base32.py )
* [base64 cipher ](https://github.com/TheAlgorithms/Python/blob/master/ciphers/base64_cipher.py )
* [base85 ](https://github.com/TheAlgorithms/Python/blob/master/ciphers/base85.py )
* [brute force caesar cipher ](https://github.com/TheAlgorithms/Python/blob/master/ciphers/brute_force_caesar_cipher.py )
* [caesar cipher ](https://github.com/TheAlgorithms/Python/blob/master/ciphers/caesar_cipher.py )
* [cryptomath module ](https://github.com/TheAlgorithms/Python/blob/master/ciphers/cryptomath_module.py )
* [elgamal key generator ](https://github.com/TheAlgorithms/Python/blob/master/ciphers/elgamal_key_generator.py )
* [hill cipher ](https://github.com/TheAlgorithms/Python/blob/master/ciphers/hill_cipher.py )
2019-07-13 19:50:37 +00:00
* [morse code implementation ](https://github.com/TheAlgorithms/Python/blob/master/ciphers/morse_code_implementation.py )
2019-06-17 10:17:53 +00:00
* [onepad cipher ](https://github.com/TheAlgorithms/Python/blob/master/ciphers/onepad_cipher.py )
* [playfair cipher ](https://github.com/TheAlgorithms/Python/blob/master/ciphers/playfair_cipher.py )
* [rabin miller ](https://github.com/TheAlgorithms/Python/blob/master/ciphers/rabin_miller.py )
* [rot13 ](https://github.com/TheAlgorithms/Python/blob/master/ciphers/rot13.py )
* [rsa cipher ](https://github.com/TheAlgorithms/Python/blob/master/ciphers/rsa_cipher.py )
* [rsa key generator ](https://github.com/TheAlgorithms/Python/blob/master/ciphers/rsa_key_generator.py )
* [simple substitution cipher ](https://github.com/TheAlgorithms/Python/blob/master/ciphers/simple_substitution_cipher.py )
* [trafid cipher ](https://github.com/TheAlgorithms/Python/blob/master/ciphers/trafid_cipher.py )
* [transposition cipher ](https://github.com/TheAlgorithms/Python/blob/master/ciphers/transposition_cipher.py )
* [transposition cipher encrypt decrypt file ](https://github.com/TheAlgorithms/Python/blob/master/ciphers/transposition_cipher_encrypt_decrypt_file.py )
* [vigenere cipher ](https://github.com/TheAlgorithms/Python/blob/master/ciphers/vigenere_cipher.py )
* [xor cipher ](https://github.com/TheAlgorithms/Python/blob/master/ciphers/xor_cipher.py )
## Compression
2019-07-20 07:36:55 +00:00
* [burrows wheeler ](https://github.com/TheAlgorithms/Python/blob/master/compression/burrows_wheeler.py )
2019-06-17 10:17:53 +00:00
* [huffman ](https://github.com/TheAlgorithms/Python/blob/master/compression/huffman.py )
2019-07-13 19:50:37 +00:00
* [peak signal to noise ratio ](https://github.com/TheAlgorithms/Python/blob/master/compression/peak_signal_to_noise_ratio.py )
* Image Data
## Conversions
* [decimal to binary ](https://github.com/TheAlgorithms/Python/blob/master/conversions/decimal_to_binary.py )
* [decimal to hexadecimal ](https://github.com/TheAlgorithms/Python/blob/master/conversions/decimal_to_hexadecimal.py )
* [decimal to octal ](https://github.com/TheAlgorithms/Python/blob/master/conversions/decimal_to_octal.py )
2019-06-17 10:17:53 +00:00
## Data Structures
* Binary Tree
2019-07-13 19:50:37 +00:00
* [avl tree ](https://github.com/TheAlgorithms/Python/blob/master/data_structures/binary_tree/avl_tree.py )
* [basic binary tree ](https://github.com/TheAlgorithms/Python/blob/master/data_structures/binary_tree/basic_binary_tree.py )
2019-07-04 15:18:57 +00:00
* [binary search tree ](https://github.com/TheAlgorithms/Python/blob/master/data_structures/binary_tree/binary_search_tree.py )
* [fenwick tree ](https://github.com/TheAlgorithms/Python/blob/master/data_structures/binary_tree/fenwick_tree.py )
* [lazy segment tree ](https://github.com/TheAlgorithms/Python/blob/master/data_structures/binary_tree/lazy_segment_tree.py )
2019-07-13 19:50:37 +00:00
* [lca ](https://github.com/TheAlgorithms/Python/blob/master/data_structures/binary_tree/lca.py )
* [red black tree ](https://github.com/TheAlgorithms/Python/blob/master/data_structures/binary_tree/red_black_tree.py )
2019-07-04 15:18:57 +00:00
* [segment tree ](https://github.com/TheAlgorithms/Python/blob/master/data_structures/binary_tree/segment_tree.py )
* [treap ](https://github.com/TheAlgorithms/Python/blob/master/data_structures/binary_tree/treap.py )
2019-06-17 10:17:53 +00:00
* Hashing
* [double hash ](https://github.com/TheAlgorithms/Python/blob/master/data_structures/hashing/double_hash.py )
* [hash table ](https://github.com/TheAlgorithms/Python/blob/master/data_structures/hashing/hash_table.py )
* [hash table with linked list ](https://github.com/TheAlgorithms/Python/blob/master/data_structures/hashing/hash_table_with_linked_list.py )
* [quadratic probing ](https://github.com/TheAlgorithms/Python/blob/master/data_structures/hashing/quadratic_probing.py )
* Number Theory
* [prime numbers ](https://github.com/TheAlgorithms/Python/blob/master/data_structures/hashing/number_theory/prime_numbers.py )
* Heap
* [heap ](https://github.com/TheAlgorithms/Python/blob/master/data_structures/heap/heap.py )
* Linked List
* [doubly linked list ](https://github.com/TheAlgorithms/Python/blob/master/data_structures/linked_list/doubly_linked_list.py )
2019-07-13 19:50:37 +00:00
* [is palindrome ](https://github.com/TheAlgorithms/Python/blob/master/data_structures/linked_list/is_palindrome.py )
2019-06-17 10:17:53 +00:00
* [singly linked list ](https://github.com/TheAlgorithms/Python/blob/master/data_structures/linked_list/singly_linked_list.py )
2019-07-13 19:50:37 +00:00
* [swap nodes ](https://github.com/TheAlgorithms/Python/blob/master/data_structures/linked_list/swap_nodes.py )
2019-06-17 10:17:53 +00:00
* Queue
* [double ended queue ](https://github.com/TheAlgorithms/Python/blob/master/data_structures/queue/double_ended_queue.py )
* [queue on list ](https://github.com/TheAlgorithms/Python/blob/master/data_structures/queue/queue_on_list.py )
* [queue on pseudo stack ](https://github.com/TheAlgorithms/Python/blob/master/data_structures/queue/queue_on_pseudo_stack.py )
* Stacks
* [balanced parentheses ](https://github.com/TheAlgorithms/Python/blob/master/data_structures/stacks/balanced_parentheses.py )
* [infix to postfix conversion ](https://github.com/TheAlgorithms/Python/blob/master/data_structures/stacks/infix_to_postfix_conversion.py )
* [infix to prefix conversion ](https://github.com/TheAlgorithms/Python/blob/master/data_structures/stacks/infix_to_prefix_conversion.py )
2019-07-13 19:50:37 +00:00
* [next greater element ](https://github.com/TheAlgorithms/Python/blob/master/data_structures/stacks/next_greater_element.py )
2019-06-17 10:17:53 +00:00
* [postfix evaluation ](https://github.com/TheAlgorithms/Python/blob/master/data_structures/stacks/postfix_evaluation.py )
* [stack ](https://github.com/TheAlgorithms/Python/blob/master/data_structures/stacks/stack.py )
* [stock span problem ](https://github.com/TheAlgorithms/Python/blob/master/data_structures/stacks/stock_span_problem.py )
* Trie
* [trie ](https://github.com/TheAlgorithms/Python/blob/master/data_structures/trie/trie.py )
## Digital Image Processing
2019-07-13 19:50:37 +00:00
* Edge Detection
* [canny ](https://github.com/TheAlgorithms/Python/blob/master/digital_image_processing/edge_detection/canny.py )
2019-06-17 10:17:53 +00:00
* Filters
2019-07-13 19:50:37 +00:00
* [convolve ](https://github.com/TheAlgorithms/Python/blob/master/digital_image_processing/filters/convolve.py )
* [gaussian filter ](https://github.com/TheAlgorithms/Python/blob/master/digital_image_processing/filters/gaussian_filter.py )
2019-06-17 10:17:53 +00:00
* [median filter ](https://github.com/TheAlgorithms/Python/blob/master/digital_image_processing/filters/median_filter.py )
2019-07-13 19:50:37 +00:00
* [sobel filter ](https://github.com/TheAlgorithms/Python/blob/master/digital_image_processing/filters/sobel_filter.py )
* Image Data
## Divide And Conquer
* [closest pair of points ](https://github.com/TheAlgorithms/Python/blob/master/divide_and_conquer/closest_pair_of_points.py )
* [max subarray sum ](https://github.com/TheAlgorithms/Python/blob/master/divide_and_conquer/max_subarray_sum.py )
2019-06-17 10:17:53 +00:00
## Dynamic Programming
* [abbreviation ](https://github.com/TheAlgorithms/Python/blob/master/dynamic_programming/abbreviation.py )
* [bitmask ](https://github.com/TheAlgorithms/Python/blob/master/dynamic_programming/bitmask.py )
2019-07-20 07:36:55 +00:00
* [climbing stairs ](https://github.com/TheAlgorithms/Python/blob/master/dynamic_programming/climbing_stairs.py )
2019-06-17 10:17:53 +00:00
* [coin change ](https://github.com/TheAlgorithms/Python/blob/master/dynamic_programming/coin_change.py )
* [edit distance ](https://github.com/TheAlgorithms/Python/blob/master/dynamic_programming/edit_distance.py )
2019-07-20 07:36:55 +00:00
* [factorial ](https://github.com/TheAlgorithms/Python/blob/master/dynamic_programming/factorial.py )
2019-06-17 10:17:53 +00:00
* [fast fibonacci ](https://github.com/TheAlgorithms/Python/blob/master/dynamic_programming/fast_fibonacci.py )
* [fibonacci ](https://github.com/TheAlgorithms/Python/blob/master/dynamic_programming/fibonacci.py )
* [floyd warshall ](https://github.com/TheAlgorithms/Python/blob/master/dynamic_programming/floyd_warshall.py )
2019-07-13 19:50:37 +00:00
* [fractional knapsack ](https://github.com/TheAlgorithms/Python/blob/master/dynamic_programming/fractional_knapsack.py )
2019-06-17 10:17:53 +00:00
* [integer partition ](https://github.com/TheAlgorithms/Python/blob/master/dynamic_programming/integer_partition.py )
* [k means clustering tensorflow ](https://github.com/TheAlgorithms/Python/blob/master/dynamic_programming/k_means_clustering_tensorflow.py )
* [knapsack ](https://github.com/TheAlgorithms/Python/blob/master/dynamic_programming/knapsack.py )
* [longest common subsequence ](https://github.com/TheAlgorithms/Python/blob/master/dynamic_programming/longest_common_subsequence.py )
* [longest increasing subsequence ](https://github.com/TheAlgorithms/Python/blob/master/dynamic_programming/longest_increasing_subsequence.py )
2019-07-13 19:50:37 +00:00
* [longest increasing subsequence o(nlogn) ](https://github.com/TheAlgorithms/Python/blob/master/dynamic_programming/longest_increasing_subsequence_o(nlogn ).py)
2019-06-17 10:17:53 +00:00
* [longest sub array ](https://github.com/TheAlgorithms/Python/blob/master/dynamic_programming/longest_sub_array.py )
* [matrix chain order ](https://github.com/TheAlgorithms/Python/blob/master/dynamic_programming/matrix_chain_order.py )
* [max sub array ](https://github.com/TheAlgorithms/Python/blob/master/dynamic_programming/max_sub_array.py )
* [minimum partition ](https://github.com/TheAlgorithms/Python/blob/master/dynamic_programming/minimum_partition.py )
* [rod cutting ](https://github.com/TheAlgorithms/Python/blob/master/dynamic_programming/rod_cutting.py )
* [subset generation ](https://github.com/TheAlgorithms/Python/blob/master/dynamic_programming/subset_generation.py )
2019-07-13 19:50:37 +00:00
* [sum of subset ](https://github.com/TheAlgorithms/Python/blob/master/dynamic_programming/sum_of_subset.py )
2019-06-17 10:17:53 +00:00
## File Transfer Protocol
* [ftp client server ](https://github.com/TheAlgorithms/Python/blob/master/file_transfer_protocol/ftp_client_server.py )
* [ftp send receive ](https://github.com/TheAlgorithms/Python/blob/master/file_transfer_protocol/ftp_send_receive.py )
## Graphs
* [a star ](https://github.com/TheAlgorithms/Python/blob/master/graphs/a_star.py )
* [articulation points ](https://github.com/TheAlgorithms/Python/blob/master/graphs/articulation_points.py )
* [basic graphs ](https://github.com/TheAlgorithms/Python/blob/master/graphs/basic_graphs.py )
* [bellman ford ](https://github.com/TheAlgorithms/Python/blob/master/graphs/bellman_ford.py )
2019-07-13 19:50:37 +00:00
* [bfs ](https://github.com/TheAlgorithms/Python/blob/master/graphs/bfs.py )
2019-06-17 10:17:53 +00:00
* [bfs shortest path ](https://github.com/TheAlgorithms/Python/blob/master/graphs/bfs_shortest_path.py )
* [breadth first search ](https://github.com/TheAlgorithms/Python/blob/master/graphs/breadth_first_search.py )
* [check bipartite graph bfs ](https://github.com/TheAlgorithms/Python/blob/master/graphs/check_bipartite_graph_bfs.py )
* [check bipartite graph dfs ](https://github.com/TheAlgorithms/Python/blob/master/graphs/check_bipartite_graph_dfs.py )
* [depth first search ](https://github.com/TheAlgorithms/Python/blob/master/graphs/depth_first_search.py )
2019-07-13 19:50:37 +00:00
* [dfs ](https://github.com/TheAlgorithms/Python/blob/master/graphs/dfs.py )
2019-06-17 10:17:53 +00:00
* [dijkstra ](https://github.com/TheAlgorithms/Python/blob/master/graphs/dijkstra.py )
* [dijkstra 2 ](https://github.com/TheAlgorithms/Python/blob/master/graphs/dijkstra_2.py )
* [dijkstra algorithm ](https://github.com/TheAlgorithms/Python/blob/master/graphs/dijkstra_algorithm.py )
2019-07-13 19:50:37 +00:00
* [directed and undirected (weighted) graph ](https://github.com/TheAlgorithms/Python/blob/master/graphs/directed_and_undirected_(weighted )_graph.py)
2019-06-17 10:17:53 +00:00
* [edmonds karp multiple source and sink ](https://github.com/TheAlgorithms/Python/blob/master/graphs/edmonds_karp_multiple_source_and_sink.py )
2019-07-13 19:50:37 +00:00
* [eulerian path and circuit for undirected graph ](https://github.com/TheAlgorithms/Python/blob/master/graphs/eulerian_path_and_circuit_for_undirected_graph.py )
2019-06-17 10:17:53 +00:00
* [even tree ](https://github.com/TheAlgorithms/Python/blob/master/graphs/even_tree.py )
* [finding bridges ](https://github.com/TheAlgorithms/Python/blob/master/graphs/finding_bridges.py )
* [graph list ](https://github.com/TheAlgorithms/Python/blob/master/graphs/graph_list.py )
* [graph matrix ](https://github.com/TheAlgorithms/Python/blob/master/graphs/graph_matrix.py )
2019-07-20 07:36:55 +00:00
* [graphs floyd warshall ](https://github.com/TheAlgorithms/Python/blob/master/graphs/graphs_floyd_warshall.py )
2019-06-17 10:17:53 +00:00
* [kahns algorithm long ](https://github.com/TheAlgorithms/Python/blob/master/graphs/kahns_algorithm_long.py )
* [kahns algorithm topo ](https://github.com/TheAlgorithms/Python/blob/master/graphs/kahns_algorithm_topo.py )
* [minimum spanning tree kruskal ](https://github.com/TheAlgorithms/Python/blob/master/graphs/minimum_spanning_tree_kruskal.py )
* [minimum spanning tree prims ](https://github.com/TheAlgorithms/Python/blob/master/graphs/minimum_spanning_tree_prims.py )
* [multi hueristic astar ](https://github.com/TheAlgorithms/Python/blob/master/graphs/multi_hueristic_astar.py )
* [page rank ](https://github.com/TheAlgorithms/Python/blob/master/graphs/page_rank.py )
* [prim ](https://github.com/TheAlgorithms/Python/blob/master/graphs/prim.py )
* [scc kosaraju ](https://github.com/TheAlgorithms/Python/blob/master/graphs/scc_kosaraju.py )
* [tarjans scc ](https://github.com/TheAlgorithms/Python/blob/master/graphs/tarjans_scc.py )
## Hashes
* [chaos machine ](https://github.com/TheAlgorithms/Python/blob/master/hashes/chaos_machine.py )
2019-07-13 19:50:37 +00:00
* [enigma machine ](https://github.com/TheAlgorithms/Python/blob/master/hashes/enigma_machine.py )
2019-06-17 10:17:53 +00:00
* [md5 ](https://github.com/TheAlgorithms/Python/blob/master/hashes/md5.py )
* [sha1 ](https://github.com/TheAlgorithms/Python/blob/master/hashes/sha1.py )
## Linear Algebra Python
* Src
* [lib ](https://github.com/TheAlgorithms/Python/blob/master/linear_algebra_python/src/lib.py )
* [tests ](https://github.com/TheAlgorithms/Python/blob/master/linear_algebra_python/src/tests.py )
## Machine Learning
* [decision tree ](https://github.com/TheAlgorithms/Python/blob/master/machine_learning/decision_tree.py )
* [gradient descent ](https://github.com/TheAlgorithms/Python/blob/master/machine_learning/gradient_descent.py )
* [k means clust ](https://github.com/TheAlgorithms/Python/blob/master/machine_learning/k_means_clust.py )
2019-07-13 19:50:37 +00:00
* [knn sklearn ](https://github.com/TheAlgorithms/Python/blob/master/machine_learning/knn_sklearn.py )
2019-06-17 10:17:53 +00:00
* [linear regression ](https://github.com/TheAlgorithms/Python/blob/master/machine_learning/linear_regression.py )
* [logistic regression ](https://github.com/TheAlgorithms/Python/blob/master/machine_learning/logistic_regression.py )
2019-07-20 07:36:55 +00:00
* [NaiveBayes ](https://github.com/TheAlgorithms/Python/blob/master/machine_learning/NaiveBayes.ipynb )
2019-06-17 10:17:53 +00:00
* [perceptron ](https://github.com/TheAlgorithms/Python/blob/master/machine_learning/perceptron.py )
2019-07-20 07:36:55 +00:00
* [reuters one vs rest classifier ](https://github.com/TheAlgorithms/Python/blob/master/machine_learning/reuters_one_vs_rest_classifier.ipynb )
2019-06-17 10:17:53 +00:00
* [scoring functions ](https://github.com/TheAlgorithms/Python/blob/master/machine_learning/scoring_functions.py )
* Random Forest Classification
2019-07-13 19:50:37 +00:00
* [random forest classification ](https://github.com/TheAlgorithms/Python/blob/master/machine_learning/random_forest_classification/random_forest_classification.py )
2019-07-20 07:36:55 +00:00
* [random forest classifier ](https://github.com/TheAlgorithms/Python/blob/master/machine_learning/random_forest_classification/random_forest_classifier.ipynb )
2019-07-13 19:50:37 +00:00
* [Social Network Ads ](https://github.com/TheAlgorithms/Python/blob/master/machine_learning/random_forest_classification/Social_Network_Ads.csv )
2019-06-17 10:17:53 +00:00
* Random Forest Regression
2019-07-13 19:50:37 +00:00
* [Position Salaries ](https://github.com/TheAlgorithms/Python/blob/master/machine_learning/random_forest_regression/Position_Salaries.csv )
2019-07-20 07:36:55 +00:00
* [random forest regression ](https://github.com/TheAlgorithms/Python/blob/master/machine_learning/random_forest_regression/random_forest_regression.ipynb )
2019-07-13 19:50:37 +00:00
* [random forest regression ](https://github.com/TheAlgorithms/Python/blob/master/machine_learning/random_forest_regression/random_forest_regression.py )
2019-06-17 10:17:53 +00:00
## Maths
* [3n+1 ](https://github.com/TheAlgorithms/Python/blob/master/maths/3n+1.py )
* [abs ](https://github.com/TheAlgorithms/Python/blob/master/maths/abs.py )
2019-07-13 19:50:37 +00:00
* [abs max ](https://github.com/TheAlgorithms/Python/blob/master/maths/abs_max.py )
* [abs min ](https://github.com/TheAlgorithms/Python/blob/master/maths/abs_min.py )
* [average mean ](https://github.com/TheAlgorithms/Python/blob/master/maths/average_mean.py )
* [average median ](https://github.com/TheAlgorithms/Python/blob/master/maths/average_median.py )
2019-06-17 10:17:53 +00:00
* [basic maths ](https://github.com/TheAlgorithms/Python/blob/master/maths/basic_maths.py )
2019-07-13 19:50:37 +00:00
* [binary exponentiation ](https://github.com/TheAlgorithms/Python/blob/master/maths/binary_exponentiation.py )
2019-06-17 10:17:53 +00:00
* [extended euclidean algorithm ](https://github.com/TheAlgorithms/Python/blob/master/maths/extended_euclidean_algorithm.py )
* [factorial python ](https://github.com/TheAlgorithms/Python/blob/master/maths/factorial_python.py )
* [factorial recursive ](https://github.com/TheAlgorithms/Python/blob/master/maths/factorial_recursive.py )
* [fermat little theorem ](https://github.com/TheAlgorithms/Python/blob/master/maths/fermat_little_theorem.py )
* [fibonacci ](https://github.com/TheAlgorithms/Python/blob/master/maths/fibonacci.py )
* [fibonacci sequence recursion ](https://github.com/TheAlgorithms/Python/blob/master/maths/fibonacci_sequence_recursion.py )
* [find lcm ](https://github.com/TheAlgorithms/Python/blob/master/maths/find_lcm.py )
2019-07-13 19:50:37 +00:00
* [find max ](https://github.com/TheAlgorithms/Python/blob/master/maths/find_max.py )
* [find min ](https://github.com/TheAlgorithms/Python/blob/master/maths/find_min.py )
2019-06-17 10:17:53 +00:00
* [greater common divisor ](https://github.com/TheAlgorithms/Python/blob/master/maths/greater_common_divisor.py )
2019-07-20 07:36:55 +00:00
* [lucas series ](https://github.com/TheAlgorithms/Python/blob/master/maths/lucas_series.py )
2019-06-17 10:17:53 +00:00
* [modular exponential ](https://github.com/TheAlgorithms/Python/blob/master/maths/modular_exponential.py )
* [newton raphson ](https://github.com/TheAlgorithms/Python/blob/master/maths/newton_raphson.py )
2019-07-13 19:50:37 +00:00
* [prime check ](https://github.com/TheAlgorithms/Python/blob/master/maths/prime_check.py )
2019-06-17 10:17:53 +00:00
* [segmented sieve ](https://github.com/TheAlgorithms/Python/blob/master/maths/segmented_sieve.py )
* [sieve of eratosthenes ](https://github.com/TheAlgorithms/Python/blob/master/maths/sieve_of_eratosthenes.py )
* [simpson rule ](https://github.com/TheAlgorithms/Python/blob/master/maths/simpson_rule.py )
* [trapezoidal rule ](https://github.com/TheAlgorithms/Python/blob/master/maths/trapezoidal_rule.py )
2019-07-13 19:50:37 +00:00
* [volume ](https://github.com/TheAlgorithms/Python/blob/master/maths/volume.py )
2019-06-17 10:17:53 +00:00
## Matrix
2019-07-04 15:18:57 +00:00
* [matrix operation ](https://github.com/TheAlgorithms/Python/blob/master/matrix/matrix_operation.py )
2019-07-20 07:36:55 +00:00
* [nth fibonacci using matrix exponentiation ](https://github.com/TheAlgorithms/Python/blob/master/matrix/nth_fibonacci_using_matrix_exponentiation.py )
* [rotate matrix ](https://github.com/TheAlgorithms/Python/blob/master/matrix/rotate_matrix.py )
2019-06-17 10:17:53 +00:00
* [searching in sorted matrix ](https://github.com/TheAlgorithms/Python/blob/master/matrix/searching_in_sorted_matrix.py )
2019-07-13 19:50:37 +00:00
* [spiral print ](https://github.com/TheAlgorithms/Python/blob/master/matrix/spiral_print.py )
2019-06-17 10:17:53 +00:00
## Networking Flow
* [ford fulkerson ](https://github.com/TheAlgorithms/Python/blob/master/networking_flow/ford_fulkerson.py )
* [minimum cut ](https://github.com/TheAlgorithms/Python/blob/master/networking_flow/minimum_cut.py )
## Neural Network
2019-07-13 19:50:37 +00:00
* [back propagation neural network ](https://github.com/TheAlgorithms/Python/blob/master/neural_network/back_propagation_neural_network.py )
2019-06-17 10:17:53 +00:00
* [convolution neural network ](https://github.com/TheAlgorithms/Python/blob/master/neural_network/convolution_neural_network.py )
2019-07-20 07:36:55 +00:00
* [fully connected neural network ](https://github.com/TheAlgorithms/Python/blob/master/neural_network/fully_connected_neural_network.ipynb )
2019-06-17 10:17:53 +00:00
* [perceptron ](https://github.com/TheAlgorithms/Python/blob/master/neural_network/perceptron.py )
## Other
* [anagrams ](https://github.com/TheAlgorithms/Python/blob/master/other/anagrams.py )
* [binary exponentiation ](https://github.com/TheAlgorithms/Python/blob/master/other/binary_exponentiation.py )
* [binary exponentiation 2 ](https://github.com/TheAlgorithms/Python/blob/master/other/binary_exponentiation_2.py )
* [detecting english programmatically ](https://github.com/TheAlgorithms/Python/blob/master/other/detecting_english_programmatically.py )
* [euclidean gcd ](https://github.com/TheAlgorithms/Python/blob/master/other/euclidean_gcd.py )
2019-07-13 19:50:37 +00:00
* [finding primes ](https://github.com/TheAlgorithms/Python/blob/master/other/finding_primes.py )
2019-06-17 10:17:53 +00:00
* [fischer yates shuffle ](https://github.com/TheAlgorithms/Python/blob/master/other/fischer_yates_shuffle.py )
2019-07-20 07:36:55 +00:00
* [Food wastage analysis from 1961-2013 (FAO) ](https://github.com/TheAlgorithms/Python/blob/master/other/Food%20wastage%20analysis%20from%201961-2013%20(FAO ).ipynb)
2019-06-17 10:17:53 +00:00
* [frequency finder ](https://github.com/TheAlgorithms/Python/blob/master/other/frequency_finder.py )
2019-07-13 19:50:37 +00:00
* [game of life ](https://github.com/TheAlgorithms/Python/blob/master/other/game_of_life.py )
2019-06-17 10:17:53 +00:00
* [linear congruential generator ](https://github.com/TheAlgorithms/Python/blob/master/other/linear_congruential_generator.py )
* [nested brackets ](https://github.com/TheAlgorithms/Python/blob/master/other/nested_brackets.py )
* [palindrome ](https://github.com/TheAlgorithms/Python/blob/master/other/palindrome.py )
* [password generator ](https://github.com/TheAlgorithms/Python/blob/master/other/password_generator.py )
* [primelib ](https://github.com/TheAlgorithms/Python/blob/master/other/primelib.py )
* [sierpinski triangle ](https://github.com/TheAlgorithms/Python/blob/master/other/sierpinski_triangle.py )
* [tower of hanoi ](https://github.com/TheAlgorithms/Python/blob/master/other/tower_of_hanoi.py )
* [two sum ](https://github.com/TheAlgorithms/Python/blob/master/other/two_sum.py )
* [word patterns ](https://github.com/TheAlgorithms/Python/blob/master/other/word_patterns.py )
* [words ](https://github.com/TheAlgorithms/Python/blob/master/other/words )
## Project Euler
* Problem 01
* [sol1 ](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_01/sol1.py )
* [sol2 ](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_01/sol2.py )
* [sol3 ](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_01/sol3.py )
* [sol4 ](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_01/sol4.py )
* [sol5 ](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_01/sol5.py )
* [sol6 ](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_01/sol6.py )
* Problem 02
* [sol1 ](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_02/sol1.py )
* [sol2 ](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_02/sol2.py )
* [sol3 ](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_02/sol3.py )
* [sol4 ](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_02/sol4.py )
* Problem 03
* [sol1 ](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_03/sol1.py )
* [sol2 ](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_03/sol2.py )
* Problem 04
* [sol1 ](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_04/sol1.py )
* [sol2 ](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_04/sol2.py )
* Problem 05
* [sol1 ](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_05/sol1.py )
* [sol2 ](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_05/sol2.py )
* Problem 06
* [sol1 ](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_06/sol1.py )
* [sol2 ](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_06/sol2.py )
* [sol3 ](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_06/sol3.py )
* Problem 07
* [sol1 ](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_07/sol1.py )
* [sol2 ](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_07/sol2.py )
* [sol3 ](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_07/sol3.py )
* Problem 08
* [sol1 ](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_08/sol1.py )
* [sol2 ](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_08/sol2.py )
* Problem 09
* [sol1 ](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_09/sol1.py )
* [sol2 ](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_09/sol2.py )
* [sol3 ](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_09/sol3.py )
* Problem 10
* [sol1 ](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_10/sol1.py )
* [sol2 ](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_10/sol2.py )
* Problem 11
* [sol1 ](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_11/sol1.py )
* [sol2 ](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_11/sol2.py )
* Problem 12
* [sol1 ](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_12/sol1.py )
* [sol2 ](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_12/sol2.py )
* Problem 13
* [sol1 ](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_13/sol1.py )
* Problem 14
* [sol1 ](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_14/sol1.py )
* [sol2 ](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_14/sol2.py )
* Problem 15
* [sol1 ](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_15/sol1.py )
* Problem 16
* [sol1 ](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_16/sol1.py )
2019-07-13 19:50:37 +00:00
* [sol2 ](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_16/sol2.py )
2019-06-17 10:17:53 +00:00
* Problem 17
* [sol1 ](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_17/sol1.py )
* Problem 19
* [sol1 ](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_19/sol1.py )
* Problem 20
* [sol1 ](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_20/sol1.py )
* [sol2 ](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_20/sol2.py )
* Problem 21
* [sol1 ](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_21/sol1.py )
* Problem 22
* [sol1 ](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_22/sol1.py )
* [sol2 ](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_22/sol2.py )
2019-07-04 15:18:57 +00:00
* Problem 234
* [sol1 ](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_234/sol1.py )
2019-06-17 10:17:53 +00:00
* Problem 24
* [sol1 ](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_24/sol1.py )
* Problem 25
* [sol1 ](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_25/sol1.py )
* [sol2 ](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_25/sol2.py )
* Problem 28
* [sol1 ](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_28/sol1.py )
* Problem 29
* [solution ](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_29/solution.py )
* Problem 31
* [sol1 ](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_31/sol1.py )
* Problem 36
* [sol1 ](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_36/sol1.py )
* Problem 40
* [sol1 ](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_40/sol1.py )
* Problem 48
* [sol1 ](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_48/sol1.py )
* Problem 52
* [sol1 ](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_52/sol1.py )
* Problem 53
* [sol1 ](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_53/sol1.py )
* Problem 76
* [sol1 ](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_76/sol1.py )
## Searches
* [binary search ](https://github.com/TheAlgorithms/Python/blob/master/searches/binary_search.py )
* [interpolation search ](https://github.com/TheAlgorithms/Python/blob/master/searches/interpolation_search.py )
* [jump search ](https://github.com/TheAlgorithms/Python/blob/master/searches/jump_search.py )
* [linear search ](https://github.com/TheAlgorithms/Python/blob/master/searches/linear_search.py )
* [quick select ](https://github.com/TheAlgorithms/Python/blob/master/searches/quick_select.py )
* [sentinel linear search ](https://github.com/TheAlgorithms/Python/blob/master/searches/sentinel_linear_search.py )
* [tabu search ](https://github.com/TheAlgorithms/Python/blob/master/searches/tabu_search.py )
* [ternary search ](https://github.com/TheAlgorithms/Python/blob/master/searches/ternary_search.py )
## Sorts
2019-07-13 19:50:37 +00:00
* [bitonic sort ](https://github.com/TheAlgorithms/Python/blob/master/sorts/bitonic_sort.py )
2019-06-17 10:17:53 +00:00
* [bogo sort ](https://github.com/TheAlgorithms/Python/blob/master/sorts/bogo_sort.py )
* [bubble sort ](https://github.com/TheAlgorithms/Python/blob/master/sorts/bubble_sort.py )
* [bucket sort ](https://github.com/TheAlgorithms/Python/blob/master/sorts/bucket_sort.py )
* [cocktail shaker sort ](https://github.com/TheAlgorithms/Python/blob/master/sorts/cocktail_shaker_sort.py )
* [comb sort ](https://github.com/TheAlgorithms/Python/blob/master/sorts/comb_sort.py )
* [counting sort ](https://github.com/TheAlgorithms/Python/blob/master/sorts/counting_sort.py )
* [cycle sort ](https://github.com/TheAlgorithms/Python/blob/master/sorts/cycle_sort.py )
* [external sort ](https://github.com/TheAlgorithms/Python/blob/master/sorts/external_sort.py )
* [gnome sort ](https://github.com/TheAlgorithms/Python/blob/master/sorts/gnome_sort.py )
* [heap sort ](https://github.com/TheAlgorithms/Python/blob/master/sorts/heap_sort.py )
* [insertion sort ](https://github.com/TheAlgorithms/Python/blob/master/sorts/insertion_sort.py )
* [merge sort ](https://github.com/TheAlgorithms/Python/blob/master/sorts/merge_sort.py )
* [merge sort fastest ](https://github.com/TheAlgorithms/Python/blob/master/sorts/merge_sort_fastest.py )
2019-07-13 19:50:37 +00:00
* [odd even transposition parallel ](https://github.com/TheAlgorithms/Python/blob/master/sorts/odd_even_transposition_parallel.py )
* [odd even transposition single threaded ](https://github.com/TheAlgorithms/Python/blob/master/sorts/odd_even_transposition_single_threaded.py )
2019-06-17 10:17:53 +00:00
* [pancake sort ](https://github.com/TheAlgorithms/Python/blob/master/sorts/pancake_sort.py )
* [pigeon sort ](https://github.com/TheAlgorithms/Python/blob/master/sorts/pigeon_sort.py )
* [quick sort ](https://github.com/TheAlgorithms/Python/blob/master/sorts/quick_sort.py )
* [quick sort 3 partition ](https://github.com/TheAlgorithms/Python/blob/master/sorts/quick_sort_3_partition.py )
* [radix sort ](https://github.com/TheAlgorithms/Python/blob/master/sorts/radix_sort.py )
* [random normal distribution quicksort ](https://github.com/TheAlgorithms/Python/blob/master/sorts/random_normal_distribution_quicksort.py )
* [random pivot quick sort ](https://github.com/TheAlgorithms/Python/blob/master/sorts/random_pivot_quick_sort.py )
* [selection sort ](https://github.com/TheAlgorithms/Python/blob/master/sorts/selection_sort.py )
* [shell sort ](https://github.com/TheAlgorithms/Python/blob/master/sorts/shell_sort.py )
* [tim sort ](https://github.com/TheAlgorithms/Python/blob/master/sorts/tim_sort.py )
* [topological sort ](https://github.com/TheAlgorithms/Python/blob/master/sorts/topological_sort.py )
* [tree sort ](https://github.com/TheAlgorithms/Python/blob/master/sorts/tree_sort.py )
* [wiggle sort ](https://github.com/TheAlgorithms/Python/blob/master/sorts/wiggle_sort.py )
## Strings
2019-07-13 19:50:37 +00:00
* [boyer moore search ](https://github.com/TheAlgorithms/Python/blob/master/strings/boyer_moore_search.py )
2019-06-17 10:17:53 +00:00
* [knuth morris pratt ](https://github.com/TheAlgorithms/Python/blob/master/strings/knuth_morris_pratt.py )
* [levenshtein distance ](https://github.com/TheAlgorithms/Python/blob/master/strings/levenshtein_distance.py )
* [manacher ](https://github.com/TheAlgorithms/Python/blob/master/strings/manacher.py )
* [min cost string conversion ](https://github.com/TheAlgorithms/Python/blob/master/strings/min_cost_string_conversion.py )
2019-07-13 19:50:37 +00:00
* [naive string search ](https://github.com/TheAlgorithms/Python/blob/master/strings/naive_string_search.py )
2019-06-17 10:17:53 +00:00
* [rabin karp ](https://github.com/TheAlgorithms/Python/blob/master/strings/rabin_karp.py )
## Traversals
* [binary tree traversals ](https://github.com/TheAlgorithms/Python/blob/master/traversals/binary_tree_traversals.py )
