mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-11-27 23:11:09 +00:00
3de6f010c3
* Refactor strings/remove_duplicate to more pythonic
* updating DIRECTORY.md
Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
56 KiB
56 KiB
Arithmetic Analysis
- Bisection
- Gaussian Elimination
- In Static Equilibrium
- Intersection
- Lu Decomposition
- Newton Forward Interpolation
- Newton Method
- Newton Raphson
- Secant Method
Backtracking
- All Combinations
- All Permutations
- All Subsequences
- Coloring
- Hamiltonian Cycle
- Minimax
- N Queens
- Sudoku
- Sum Of Subsets
Blockchain
Boolean Algebra
Cellular Automata
Ciphers
- A1Z26
- Affine Cipher
- Atbash
- Base16
- Base32
- Base64 Cipher
- Base85
- Brute Force Caesar Cipher
- Caesar Cipher
- Cryptomath Module
- Decrypt Caesar With Chi Squared
- Deterministic Miller Rabin
- Diffie
- Elgamal Key Generator
- Hill Cipher
- Mixed Keyword Cypher
- Morse Code Implementation
- Onepad Cipher
- Playfair Cipher
- Porta Cipher
- Rabin Miller
- Rot13
- Rsa Cipher
- Rsa Factorization
- Rsa Key Generator
- Shuffled Shift Cipher
- Simple Keyword Cypher
- Simple Substitution Cipher
- Trafid Cipher
- Transposition Cipher
- Transposition Cipher Encrypt Decrypt File
- Vigenere Cipher
- Xor Cipher
Compression
Computer Vision
Conversions
Data Structures
- Binary Tree
- Data Structures
- Heap
- Disjoint Set
- Hashing
- Heap
- Linked List
- Queue
- Stacks
- Trie
Digital Image Processing
- Change Contrast
- Convert To Negative
- Dithering
- Edge Detection
- Filters
- Histogram Equalization
- Index Calculation
- Resize
- Rotation
- Sepia
- Test Digital Image Processing
Divide And Conquer
- Closest Pair Of Points
- Convex Hull
- Inversions
- Max Subarray Sum
- Mergesort
- Power
- Strassen Matrix Multiplication
Dynamic Programming
- Abbreviation
- Bitmask
- Climbing Stairs
- Coin Change
- Edit Distance
- Factorial
- Fast Fibonacci
- Fibonacci
- Floyd Warshall
- Fractional Knapsack
- Fractional Knapsack 2
- Integer Partition
- Iterating Through Submasks
- Knapsack
- Longest Common Subsequence
- Longest Increasing Subsequence
- Longest Increasing Subsequence O(Nlogn)
- Longest Sub Array
- Matrix Chain Order
- Max Sub Array
- Max Sum Contiguous Subsequence
- Minimum Partition
- Optimal Binary Search Tree
- Rod Cutting
- Subset Generation
- Sum Of Subset
File Transfer
Fuzzy Logic
Geodesy
Graphics
Graphs
- A Star
- Articulation Points
- Basic Graphs
- Bellman Ford
- Bfs
- Bfs Shortest Path
- Bidirectional A Star
- Breadth First Search
- Breadth First Search Shortest Path
- Check Bipartite Graph Bfs
- Check Bipartite Graph Dfs
- Depth First Search
- Depth First Search 2
- Dijkstra
- Dijkstra 2
- Dijkstra Algorithm
- Dinic
- Directed And Undirected (Weighted) Graph
- Edmonds Karp Multiple Source And Sink
- Eulerian Path And Circuit For Undirected Graph
- Even Tree
- Finding Bridges
- Frequent Pattern Graph Miner
- G Topological Sort
- Graph List
- Graph Matrix
- Graphs Floyd Warshall
- Greedy Best First
- Kahns Algorithm Long
- Kahns Algorithm Topo
- Minimum Spanning Tree Boruvka
- Minimum Spanning Tree Kruskal
- Minimum Spanning Tree Prims
- Multi Heuristic Astar
- Page Rank
- Prim
- Scc Kosaraju
- Tarjans Scc
Greedy Method
Hashes
Linear Algebra
Machine Learning
- Astar
- Decision Tree
- Gaussian Naive Bayes
- Gradient Descent
- K Means Clust
- K Nearest Neighbours
- Knn Sklearn
- Linear Discriminant Analysis
- Linear Regression
- Logistic Regression
- Lstm
- Multilayer Perceptron Classifier
- Polymonial Regression
- Random Forest Classifier
- Random Forest Regressor
- Scoring Functions
- Sequential Minimum Optimization
- Support Vector Machines
Maths
- 3N Plus 1
- Abs
- Abs Max
- Abs Min
- Add
- Aliquot Sum
- Allocation Number
- Area
- Area Under Curve
- Armstrong Numbers
- Average Mean
- Average Median
- Average Mode
- Bailey Borwein Plouffe
- Basic Maths
- Binary Exp Mod
- Binary Exponentiation
- Binomial Coefficient
- Bisection
- Ceil
- Chudnovsky Algorithm
- Collatz Sequence
- Combinations
- Eulers Totient
- Explicit Euler
- Extended Euclidean Algorithm
- Factorial Iterative
- Factorial Python
- Factorial Recursive
- Factors
- Fermat Little Theorem
- Fibonacci
- Fibonacci Sequence Recursion
- Find Max
- Find Max Recursion
- Find Min
- Find Min Recursion
- Floor
- Gamma
- Gaussian
- Greatest Common Divisor
- Hardy Ramanujanalgo
- Is Square Free
- Jaccard Similarity
- Kadanes
- Karatsuba
- Kth Lexicographic Permutation
- Largest Of Very Large Numbers
- Least Common Multiple
- Line Length
- Lucas Lehmer Primality Test
- Lucas Series
- Matrix Exponentiation
- Miller Rabin
- Mobius Function
- Modular Exponential
- Monte Carlo
- Monte Carlo Dice
- Newton Raphson
- Number Of Digits
- Numerical Integration
- Perfect Square
- Pi Monte Carlo Estimation
- Polynomial Evaluation
- Prime Check
- Prime Factors
- Prime Numbers
- Prime Sieve Eratosthenes
- Pythagoras
- Qr Decomposition
- Quadratic Equations Complex Numbers
- Radians
- Radix2 Fft
- Relu
- Runge Kutta
- Segmented Sieve
- Series
- Sieve Of Eratosthenes
- Simpson Rule
- Softmax
- Square Root
- Sum Of Arithmetic Series
- Sum Of Digits
- Test Prime Check
- Trapezoidal Rule
- Volume
- Zellers Congruence
Matrix
- Matrix Class
- Matrix Operation
- Nth Fibonacci Using Matrix Exponentiation
- Rotate Matrix
- Searching In Sorted Matrix
- Sherman Morrison
- Spiral Print
- Tests
Networking Flow
Neural Network
Other
- Activity Selection
- Anagrams
- Autocomplete Using Trie
- Binary Exponentiation
- Binary Exponentiation 2
- Detecting English Programmatically
- Dijkstra Bankers Algorithm
- Euclidean Gcd
- Fischer Yates Shuffle
- Frequency Finder
- Game Of Life
- Gauss Easter
- Greedy
- Integeration By Simpson Approx
- Largest Subarray Sum
- Least Recently Used
- Linear Congruential Generator
- Magicdiamondpattern
- Nested Brackets
- Palindrome
- Password Generator
- Primelib
- Sdes
- Sierpinski Triangle
- Tower Of Hanoi
- Two Sum
- Word Patterns
Project Euler
- Problem 01
- Problem 02
- Problem 03
- Problem 04
- Problem 05
- Problem 06
- Problem 07
- Problem 08
- Problem 09
- Problem 10
- Problem 11
- Problem 12
- Problem 13
- Problem 14
- Problem 15
- Problem 16
- Problem 17
- Problem 18
- Problem 19
- Problem 20
- Problem 21
- Problem 22
- Problem 23
- Problem 234
- Problem 24
- Problem 25
- Problem 26
- Problem 27
- Problem 28
- Problem 29
- Problem 30
- Problem 31
- Problem 32
- Problem 33
- Problem 36
- Problem 40
- Problem 42
- Problem 48
- Problem 52
- Problem 53
- Problem 551
- Problem 56
- Problem 67
- Problem 76
- Problem 99
Scheduling
Searches
- Binary Search
- Fibonacci Search
- Hill Climbing
- Interpolation Search
- Jump Search
- Linear Search
- Quick Select
- Sentinel Linear Search
- Simple-Binary-Search
- Simulated Annealing
- Tabu Search
- Ternary Search
Sorts
- Bead Sort
- Bitonic Sort
- Bogo Sort
- Bubble Sort
- Bucket Sort
- Cocktail Shaker Sort
- Comb Sort
- Counting Sort
- Cycle Sort
- Double Sort
- External Sort
- Gnome Sort
- Heap Sort
- I Sort
- Insertion Sort
- Iterative Merge Sort
- Merge Sort
- Odd Even Transposition Parallel
- Odd Even Transposition Single Threaded
- Pancake Sort
- Pigeon Sort
- Pigeonhole Sort
- Quick Sort
- Quick Sort 3 Partition
- Radix Sort
- Random Normal Distribution Quicksort
- Random Pivot Quick Sort
- Recursive-Quick-Sort
- Recursive Bubble Sort
- Recursive Insertion Sort
- Selection Sort
- Shell Sort
- Sleep Sort
- Stooge Sort
- Strand Sort
- Tim Sort
- Topological Sort
- Tree Sort
- Unknown Sort
- Wiggle Sort
Strings
- Aho-Corasick
- Boyer Moore Search
- Check Pangram
- Is Palindrome
- Jaro Winkler
- Knuth Morris Pratt
- Levenshtein Distance
- Lower
- Manacher
- Min Cost String Conversion
- Naive String Search
- Rabin Karp
- Remove Duplicate
- Reverse Words
- Split
- Upper
- Word Occurrence