These implementations are for learning purposes. They may be less efficient than the implementations in the Python standard library.
Anup Kumar Panwar [Gmail Gihub LinkedIn]
Chetan Kaushik [Gmail Gihub LinkedIn]
Read our Contribution Guidelines before you contribute.
We're on Gitter! Please join us.
- Transposition Cipher
- Atbash
- Rot13
- Rabin Miller
- Transposition Cipher Encrypt Decrypt File
- Affine Cipher
- Trafid Cipher
- Base16
- Elgamal Key Generator
- Rsa Cipher
- Prehistoric Men.txt
- Vigenere Cipher
- Xor Cipher
- Brute Force Caesar Cipher
- Rsa Key Generator
- Simple Substitution Cipher
- Playfair Cipher
- Morse Code Implementation
- Base32
- Base85
- Base64 Cipher
- Onepad Cipher
- Caesar Cipher
- Hill Cipher
- Cryptomath Module
- Average
- Abs Max
- Average Median
- Trapezoidal Rule
- Prime Check
- Modular Exponential
- Newton Raphson
- Factorial Recursive
- Extended Euclidean Algorithm
- Greater Common Divisor
- Fibonacci
- Find Lcm
- Find Max
- Fermat Little Theorem
- Factorial Python
- Fibonacci Sequence Recursion
- Sieve Of Eratosthenes
- Abs Min
- Lucas Series
- Segmented Sieve
- Find Min
- Abs
- Simpson Rule
- Basic Maths
- 3n+1
- Binary Exponentiation
- BFS Shortest Path
- Directed And Undirected (Weighted) Graph
- Minimum Spanning Tree Prims
- Graph Matrix
- Basic Graphs
- Dijkstra 2
- Tarjans Strongly Connected Components
- Check Bipartite Graph BFS
- Depth First Search
- Kahns Algorithm Long
- Breadth First Search
- Dijkstra
- Articulation Points
- Bellman Ford
- Check Bipartite Graph Dfs
- Strongly Connected Components Kosaraju
- Multi Hueristic Astar
- Page Rank
- Eulerian Path And Circuit For Undirected Graph
- Edmonds Karp Multiple Source And Sink
- Floyd Warshall
- Minimum Spanning Tree Kruskal
- Prim
- Kahns Algorithm Topo
- BFS
- Finding Bridges
- Graph List
- Dijkstra Algorithm
- A Star
- Even Tree
- DFS
- Quick Select
- Binary Search
- Interpolation Search
- Jump Search
- Linear Search
- Ternary Search
- Tabu Search
- Sentinel Linear Search
- Fractional Knapsack
- Sum Of Subset
- Fast Fibonacci
- Bitmask
- Abbreviation
- Rod Cutting
- Knapsack
- Max Sub Array
- Fibonacci
- Minimum Partition
- K Means Clustering Tensorflow
- Coin Change
- Subset Generation
- Floyd Warshall
- Longest Sub Array
- Integer Partition
- Matrix Chain Order
- Edit Distance
- Longest Common Subsequence
- Longest Increasing Subsequence O(nlogn)
- Longest Increasing Subsequence
- Knuth Morris Pratt
- Rabin Karp
- Naive String Search
- Levenshtein Distance
- Min Cost String Conversion
- Boyer Moore Search
- Manacher
- Quick Sort
- Selection Sort
- Bitonic Sort
- Cycle Sort
- Comb Sort
- Topological Sort
- Merge Sort Fastest
- Random Pivot Quick Sort
- Heap Sort
- Insertion Sort
- Counting Sort
- Bucket Sort
- Quick Sort 3 Partition
- Bogo Sort
- Shell Sort
- Pigeon Sort
- Odd-Even Transposition Parallel
- Tree Sort
- Cocktail Shaker Sort
- Random Normal Distribution Quicksort
- Wiggle Sort
- Pancake Sort
- External Sort
- Tim Sort
- Sorting Graphs.png
- Radix Sort
- Odd-Even Transposition Single-threaded
- Bubble Sort
- Gnome Sort
- Merge Sort
- Perceptron
- Random Forest Classifier
- NaiveBayes.ipynb
- Scoring Functions
- Logistic Regression
- Gradient Descent
- Linear Regression
- Random Forest Regression
- Random Forest Regression
- Reuters One Vs Rest Classifier.ipynb
- Decision Tree
- Knn Sklearn
- K Means Clust
- Perceptron
- Fully Connected Neural Network
- Convolution Neural Network
- Back Propagation Neural Network
- Detecting English Programmatically
- Fischer Yates Shuffle
- Primelib
- Binary Exponentiation 2
- Anagrams
- Palindrome
- Finding Primes
- Two Sum
- Password Generator
- Linear Congruential Generator
- Frequency Finder
- Euclidean Gcd
- Word Patterns
- Nested Brackets
- Binary Exponentiation
- Sierpinski Triangle
- Game Of Life
- Tower Of Hanoi