allalgorithms / python

Implementation of All ▲lgorithms in Python Programming Language

We are accepting all pull requests. Read More

What is an algorithm?    Contributing    Stickers & T-Shirts

Twitter     Instagram     Github    

Huge collection of All ▲lgorithms implemented in multiple languages

See

• What is an algorithm
• Contributing
• Code of Conduct
• Stickers and T-Shirts
• Twitter
• Instagram
• Algorithms Categories
• Maintainers
• License

What is an algorithm?

Informally, an algorithm is any well-defined computational procedure that takes some value, or set of values, as input and produces some value, or set of values, as output. An algorithm is thus a sequence of computational steps that transform the input into the output.

An algorithm should have three important characteristics to be considered valid:

• It should be finite: If your algorithm never ends trying to solve the problem it was designed to solve then it is useless
• It should have well defined instructions: Each step of the algorithm has to be precisely defined; the instructions should be unambiguously specified for each case.
• It should be effective: The algorithm should solve the problem it was designed to solve. And it should be possible to demonstrate that the algorithm converges with just a paper and pencil.

Categories

Structure of The All ▲lgoritms project

• Artificial Intelligence
• Backtracking
• Bit Manipulation
• Cellular Automaton
• Ciphers
• Computational Geometry
• Cryptography
• Data Structures
• Divide and conquer
• Dynamic Programming
• Gaming Theory
• Graphs
• Greedy Algorithms
• Math
• Networking
• Numerical Analysis
• Operating system
• Randomized Algorithms
• Searches
• Selections Algorithms
• Sorting
• Strings
• Online Challenges
• Others

Artificial Intelligence

• Density-based spatial clustering of applications with noise (DBSCAN Clustering)
• Interactive Self-Organizing Data Analysis Technique yAy! (ISODATA Clustering)
• Linear Regression
• Logistic Regression
• Neutral Style Transfer
• SATisfiable (SAT)
• Travelling salesman problem (TSP)
• A* (A Star)
• Artificial Neutral Network
• Convolutional Neutral Network
• Decision Tree
• Factorization Machines
• Gaussian Mixture Model
• Gradient Boosting Trees
• Hierachical Clustering
• Image Processing
• K Nearest Neighbors
• K Means
• Minimax
• Native Bayes
• Nearest Sequence Memory
• Neutral Network
• Perceptron
• Principal Component Analysis
• Q Learing
• Random Forests
• Restricted Boltzman Machine

Backtracking

• Algorithm X
• Crossword Puzzle
• Knight Tour
• M Coloring Problem
• N Queen
• Number of ways in Maze
• Partitions of set
• Permutation of Strings
• Powerset
• Rat in maze
• Subset Sum
• Sudoku Solve

Bit Manipulation

• Addition using bits
• Bit divisor
• Byte swapper
• Convert numbers to binary
• Count set bits
• Flip bits
• Hamming distance
• Invert bit
• Lonely integer
• Magic Number
• Maximum XOR Value
• Power of 2
• Subset Generation
• Sum binary numbers
• Sum equals XOR
• Thrice unique number
• Twice unique number
• XOR Swap

Cellular Automaton

• Brians Brain
• Conways Game of life
• Elementary Cellular Automata
• Generic Algorithm
• Langtons Ant
• Nobili Cellular Automata
• Von Neoumann Cellular Automata

Computational Geometry

• 2D Line intersection
• 2D Separating Axis test
• Area of polygon
• Area of triangle
• Axis aligned bounding box collision
• Bresenham Line
• Chans Algorithm
• Cohen Sutherland Lineclip
• Distance between points
• Graham Scan
• Halfplane intersection
• Jarvis March
• Quickull
• Sphere tetrahedron intersection
• Sutherland Hodgeman clipping

Cryptography

• Affine Cipher
• Atbash Cipher
• Autokey Cipher
• Baconian Cipher
• Caesar Cipher
• Colummnar Cipher
• Vigenere Cipher

Data Structures

• Bag
• Hashes
• Linked List
• List
• Queue
• Stack
• Tree

Divide and conquer

• Strassen Matrix Manipulation
• Closest Pair of Point
• Inversion Count
• Karatsuba Multiplication
• Maximum Contiguous subsequence sum
• Merge Sort using divide and conquer
• Quick Sort using divide and conquer
• Tournament Method to find min max
• Warnock Algorithm
• X Power Y

Dynamic Programming

• Array Median
• Optima Binary Search Tree
• Binomial Coefficient

Gaming Theory

• Nim Next Best Move Game
• Nim Win Loss Game
• Grundy Numbers Kayle Game

Graphs

• Bipartite Check
• Adjacency Lists graphs representation
• A* (A Star)

Greedy Algorithms

• Activity Selection
• Dijkstra Shortest Path
• Egyptian Fraction

Math

• 2 Sum
• Add Polynomials
• Amicable Numbers
• Armstrong Numbers
• Automorphic Numbers
• Average Stream Numbers
• Babylonian Method
• Binomial Coefficient
• Catalan Number
• Check is Square
• Convolution
• Coprime Numbers
• Count Digits
• Count Trailing Zeroes
• Decoding of String
• Delannoy Number
• Derangements
• DFA Division
• Diophantine
• Divided Differences
• Euler Totient
• Exponentiation Power
• Factorial
• Fast Fourier transform
• Fast inverse (sqrt) Square Root

Networking

• Packet Sniffer
• Determine Endianess
• Validate IP

Numerical Analysis

• Integral
• Monte Carlo
• Runge Kutt

Operating system

• Currency
• Deadlocks
• Memory Management
• Scheduling
• Shell

Randomized Algorithms

• Birthday Paradox
• Karger Minimum Cut Algorithm
• Kth Smallest Element Algorithm
• Random from Stream
• Random Node Linked list
• Randomized Quicksort
• Reservoir Sampling
• Shuffle an Array

Searches

• Binary Search
• Exponential Search
• Fibonacci Search
• Fuzzy Search
• Interpolation Search
• Jump Search
• Linear Search
• Ternay Search

Selections Algorithms

• Median of Medians
• Quick Select

Sorting

• Bead Sort
• Bogo Sort
• Bubble Sort
• Bucket Sort
• Circle Sort
• Comb Sort
• Counting Sort
• Cycle Sort
• Flash Sort
• Gnome Sort
• Heap Sort
• Insertion Sort
• Intro Sort
• Median Sort
• Merge Sort
• Pipeonhole Sort
• Quick Sort
• Radix Sort
• Selection Sort
• Shaker Sort
• Shell Sort
• Sleep Sort
• Stooge Sort
• Topological Sort
• Tree Sort

Strings

• Aho Corasick Algorithm
• Anagram Search
• Arithmetic on large numbers
• Boyer Moore Algorithm
• Finite Automata
• Kasai Algorithm
• Kmp Algorithm
• Levenshteing Distance
• Lipogram Checker

Online Challenges

• Coderbyte
• Code Chef
• Code Eval
• Hackerearth
• Hackerrank
• LeetCode
• Project Euler
• Rosalind
• SPOJ
• Top Coder`

Others

• Average
• Biggest of n numbers
• Biggest Suffix
• Fifteen Puzzle
• Jaccard Similarity
• Jose Phus Problem
• Lapindrom Checker
• Leap Year
• Magic Square
• Majority Element
• Minimum subarray size with degree
• No operator addition
• Paint fill
• Split list
• Tokenizer
• Unique number

License

This work is released under MIT License.

To the extent possible under law, Abraham Hernandez (@abranhe) has waived all copyright and related or neighboring rights to this work.

python's Issues

Improving code quality?

Hi! I am creating an issue because even though the project seems quite interesting, the code quality (from what I saw) is at best okay-ish, at worst simply bad, be it from only PEP8 weirdness, or non-pythonicness alone.
Though I do not mean to be disrespectful to all the contributors, it seems that the lack of code review is a cause of overall poor code quality on this repo.

I would love to help review code and contribute on my free time, but improving the current code is a daunting task that I cannot undertake alone.
I also know that reviewing code alone is really tedious, and that it would slow the contribution rate, and I understand if you don't want to integrate review in the workflow.

Sincerely,
Amaras

ㅤ

Do you know how to implement any algorithm in Python?

Hi, everyone!

Do you know any algorithm implementation in any language, that you wanna share with us?

Open a pull request in any of the programming languages available, or in Python this case

Correct implementation of Lucky Numbers Algorithms in Python

According to #32 (comment)

Hi @Zxey I liked, but it seems that the algorithm isn't properly implemented.

According to this the following gif:

From 1-100 the lucky numbers should be:

1, 3, 7, 9, 13, 15, 21, 25, 31, 33, 37, 43, 49, 51, 63, 67, 69, 73, 75, 79, 87, 93, 99

This is the link to your implementation repl.it/@abranhe/lucky-numbers-in-python online, I just set the range from 1 - 100.

In a part of the output you will see:

number 17 is not lucky
number 18 is not lucky
number 19 is lucky
number 20 is not lucky
number 21 is not lucky
number 22 is not lucky
number 23 is not lucky
number 24 is not lucky
number 25 is not lucky
number 26 is not lucky
number 27 is lucky
number 28 is not lucky

Where they don't match with the output it should be:

Eg:

• 19 isn't lucky
• 25 is lucky
• 27 isn't lucky
• and so on ...

So this need to be fixed to be merged, I am creating an issue right now, hopefuly we will implement correctly.

We need to find the a correct implementation for Lucky Numbers

error

I am creating an issue because...This is Total Error

Do you know any algorithm in Python?

Hi, everyone!

Do you know any algorithm implementation in any language, that you wanna share with us?

Open a pull request in any of the programming languages available, or in Python this case

Add .gitignore

#11 Done, pls add Hacktoberfest love 🎃

Change algorithms types on readme

• add new cryptography
• rename /greedy-algorithms to /greedy