diff --git a/.coveragerc b/.coveragerc
deleted file mode 100644
index f7e6eb212bc8..000000000000
--- a/.coveragerc
+++ /dev/null
@@ -1,4 +0,0 @@
-[report]
-sort = Cover
-omit =
- .env/*
diff --git a/.devcontainer/Dockerfile b/.devcontainer/Dockerfile
new file mode 100644
index 000000000000..edee3bc4febb
--- /dev/null
+++ b/.devcontainer/Dockerfile
@@ -0,0 +1,7 @@
+# https://github.com/microsoft/vscode-dev-containers/blob/main/containers/python-3/README.md
+ARG VARIANT=3.13-bookworm
+FROM mcr.microsoft.com/vscode/devcontainers/python:${VARIANT}
+COPY requirements.txt /tmp/pip-tmp/
+RUN python3 -m pip install --upgrade pip \
+ && python3 -m pip install --no-cache-dir -r /tmp/pip-tmp/requirements.txt \
+ && pipx install pre-commit ruff
diff --git a/.devcontainer/README.md b/.devcontainer/README.md
new file mode 100644
index 000000000000..8056578ad3a8
--- /dev/null
+++ b/.devcontainer/README.md
@@ -0,0 +1,42 @@
+# Development Container
+
+This is **Devcontainer** configuration to provide a consistent development environment for all contributors.
+
+## Features
+
+- [x] Pre-configured **Python environment**
+- [x] Automatic installation of **pre-commit hooks**
+- [x] **Ruff** linter ready to check your code
+- [x] **Oh My Zsh** with plugins:
+- `zsh-autosuggestions`
+- `zsh-syntax-highlighting`
+
+## Usage
+
+1. Install [**Docker** ](https://www.docker.com/get-started/) and [**Visual Studio Code**](https://code.visualstudio.com/)
+2. Install the **Remote - Containers** extension in VS Code
+
+ - Do `CTRL+P`, paste this command and press `Enter`
+
+ ```shell
+ ext install ms-vscode-remote.remote-containers
+ ```
+3. Open this repository in VS Code
+4. When prompted, click **"Reopen in Container"**
+5. Wait for the environment to build and initialize
+
+After setup:
+
+- `pre-commit` hooks are installed
+- `ruff` and other tools are available
+- The shell uses Zsh by default
+
+## Tips
+
+To manually run checks on all files:
+
+```bash
+pre-commit run --all-files
+```
+
+> For further information here's [Microsoft tutorial about devcontainers.](https://code.visualstudio.com/docs/devcontainers/tutorial)
diff --git a/.devcontainer/devcontainer.json b/.devcontainer/devcontainer.json
new file mode 100644
index 000000000000..195901b3e1e7
--- /dev/null
+++ b/.devcontainer/devcontainer.json
@@ -0,0 +1,57 @@
+{
+ "name": "Python 3",
+
+ // Use a prebuilt dev container image instead of building from a local
+ // Dockerfile. The repo migrated its dependencies to pyproject.toml, so the
+ // old Dockerfile's `COPY requirements.txt` step no longer had a file to copy
+ // and the image build failed. The upstream images already ship Python + a
+ // full toolchain, so pulling one is both faster and less to maintain.
+ //
+ // This repo tracks the latest-and-greatest CPython on the newest stable
+ // Debian. Images are published per CPython minor version on Debian 13
+ // "Trixie" (3.11-trixie ... 3.14-trixie); bump this to the newest available
+ // when a new stable CPython ships.
+ // NOTE: these images do not publish free-threaded (`t`) variants, so 3.14t
+ // cannot be selected via the tag alone -- but the repo's `.python-version`
+ // pins 3.14t, and `uv run`/`uv sync` in the container honor it, so uv gives
+ // contributors free-threaded 3.14t regardless of the base tag.
+ "image": "mcr.microsoft.com/devcontainers/python:latest",
+
+ // Install the tools post_install and CI expect (pre-commit + ruff), plus uv
+ // for the free-threaded workflow above, then run the existing setup script.
+ "postCreateCommand": "pipx install pre-commit ruff uv && zsh .devcontainer/post_install",
+
+ // Configure tool-specific properties.
+ "customizations": {
+ // Configure properties specific to VS Code.
+ "vscode": {
+ // Set *default* container specific settings.json values on container create.
+ "settings": {
+ "python.defaultInterpreterPath": "/usr/local/bin/python",
+ // Formatting/linting is handled by Ruff (matches pre-commit and CI).
+ "editor.formatOnSave": true,
+ "[python]": {
+ "editor.defaultFormatter": "charliermarsh.ruff",
+ "editor.codeActionsOnSave": {
+ "source.fixAll": "explicit",
+ "source.organizeImports": "explicit"
+ }
+ },
+ "terminal.integrated.defaultProfile.linux": "zsh"
+ },
+
+ // Add the IDs of extensions you want installed when the container is created.
+ "extensions": [
+ "ms-python.python",
+ "ms-python.vscode-pylance",
+ "charliermarsh.ruff"
+ ]
+ }
+ },
+
+ // Use 'forwardPorts' to make a list of ports inside the container available locally.
+ // "forwardPorts": [],
+
+ // Comment out to connect as root instead. More info: https://aka.ms/vscode-remote/containers/non-root.
+ "remoteUser": "vscode"
+}
diff --git a/.devcontainer/post_install b/.devcontainer/post_install
new file mode 100755
index 000000000000..589ee361f5cb
--- /dev/null
+++ b/.devcontainer/post_install
@@ -0,0 +1,29 @@
+#!/usr/bin/env bash
+
+echo "Begin post-installation steps..."
+
+set -e
+
+echo "Installing pre-commit hooks..."
+pre-commit install
+
+echo "Installing Oh My Zsh plugins..."
+
+# Install zsh-autosuggestions if not present
+if [ ! -d "${ZSH_CUSTOM:-$HOME/.oh-my-zsh/custom}/plugins/zsh-autosuggestions" ]; then
+ echo "Cloning zsh-autosuggestions..."
+ git clone https://github.com/zsh-users/zsh-autosuggestions \
+ "${ZSH_CUSTOM:-$HOME/.oh-my-zsh/custom}/plugins/zsh-autosuggestions"
+fi
+
+# Install zsh-syntax-highlighting if not present
+if [ ! -d "${ZSH_CUSTOM:-$HOME/.oh-my-zsh/custom}/plugins/zsh-syntax-highlighting" ]; then
+ echo "Cloning zsh-syntax-highlighting..."
+ git clone https://github.com/zsh-users/zsh-syntax-highlighting.git \
+ "${ZSH_CUSTOM:-$HOME/.oh-my-zsh/custom}/plugins/zsh-syntax-highlighting"
+fi
+
+echo "Configuring plugins in ~/.zshrc..."
+sed -i '/^plugins=/c\plugins=(git zsh-autosuggestions zsh-syntax-highlighting)' ~/.zshrc
+
+echo "Post-installation steps completed successfully. Enjoy!"
diff --git a/.github/CODEOWNERS b/.github/CODEOWNERS
index 260b9704eda7..3cc25d1bae1c 100644
--- a/.github/CODEOWNERS
+++ b/.github/CODEOWNERS
@@ -7,9 +7,7 @@
# Order is important. The last matching pattern has the most precedence.
-/.* @cclauss @dhruvmanila
-
-# /arithmetic_analysis/
+/.* @cclauss
# /backtracking/
@@ -21,21 +19,21 @@
# /cellular_automata/
-# /ciphers/ @cclauss # TODO: Uncomment this line after Hacktoberfest
+# /ciphers/
# /compression/
# /computer_vision/
-# /conversions/ @cclauss # TODO: Uncomment this line after Hacktoberfest
+# /conversions/
-# /data_structures/ @cclauss # TODO: Uncomment this line after Hacktoberfest
+# /data_structures/
-/digital_image_processing/ @mateuszz0000
+# /digital_image_processing/
# /divide_and_conquer/
-/dynamic_programming/ @Kush1101
+# /dynamic_programming/
# /file_transfer/
@@ -59,7 +57,7 @@
# /machine_learning/
-/maths/ @Kush1101
+# /maths/
# /matrix/
@@ -67,9 +65,9 @@
# /neural_network/
-# /other/ @cclauss # TODO: Uncomment this line after Hacktoberfest
+# /other/
-/project_euler/ @dhruvmanila @Kush1101
+# /project_euler/
# /quantum/
@@ -79,9 +77,9 @@
# /searches/
-/sorts/ @mateuszz0000
+# /sorts/
-# /strings/ @cclauss # TODO: Uncomment this line after Hacktoberfest
+# /strings/
# /traversals/
diff --git a/.github/ISSUE_TEMPLATE/bug_report.yml b/.github/ISSUE_TEMPLATE/bug_report.yml
new file mode 100644
index 000000000000..4ccdb52cad24
--- /dev/null
+++ b/.github/ISSUE_TEMPLATE/bug_report.yml
@@ -0,0 +1,54 @@
+name: Bug report
+description: Create a bug report to help us address errors in the repository
+labels: [bug]
+body:
+ - type: markdown
+ attributes:
+ value: >
+ Before requesting please search [existing issues](https://github.com/TheAlgorithms/Python/labels/bug).
+ Usage questions such as "How do I...?" belong on the
+ [Discord](https://discord.gg/c7MnfGFGa6) and will be closed.
+
+ - type: input
+ attributes:
+ label: "Repository commit"
+ description: >
+ The commit hash for `TheAlgorithms/Python` repository. You can get this
+ by running the command `git rev-parse HEAD` locally.
+ placeholder: "a0b0f414ae134aa1772d33bb930e5a960f9979e8"
+ validations:
+ required: true
+
+ - type: input
+ attributes:
+ label: "Python version (python --version)"
+ placeholder: "Python 3.10.7"
+ validations:
+ required: true
+
+ - type: textarea
+ attributes:
+ label: "Dependencies version (pip freeze)"
+ description: >
+ This is the output of the command `pip freeze --all`. Note that the
+ actual output might be different as compared to the placeholder text.
+ placeholder: |
+ appnope==0.1.3
+ asttokens==2.0.8
+ backcall==0.2.0
+ ...
+ validations:
+ required: true
+
+ - type: textarea
+ attributes:
+ label: "Expected behavior"
+ description: "Describe the behavior you expect. May include images or videos."
+ validations:
+ required: true
+
+ - type: textarea
+ attributes:
+ label: "Actual behavior"
+ validations:
+ required: true
diff --git a/.github/ISSUE_TEMPLATE/config.yml b/.github/ISSUE_TEMPLATE/config.yml
new file mode 100644
index 000000000000..62019bb08938
--- /dev/null
+++ b/.github/ISSUE_TEMPLATE/config.yml
@@ -0,0 +1,5 @@
+blank_issues_enabled: false
+contact_links:
+ - name: Discord community
+ url: https://discord.gg/c7MnfGFGa6
+ about: Have any questions or need any help? Please contact us via Discord
diff --git a/.github/ISSUE_TEMPLATE/feature_request.yml b/.github/ISSUE_TEMPLATE/feature_request.yml
new file mode 100644
index 000000000000..20823bd58ab1
--- /dev/null
+++ b/.github/ISSUE_TEMPLATE/feature_request.yml
@@ -0,0 +1,19 @@
+name: Feature request
+description: Suggest features, propose improvements, discuss new ideas.
+labels: [enhancement]
+body:
+ - type: markdown
+ attributes:
+ value: >
+ Before requesting please search [existing issues](https://github.com/TheAlgorithms/Python/labels/enhancement).
+ Do not create issues to implement new algorithms as these will be closed.
+ Usage questions such as "How do I...?" belong on the
+ [Discord](https://discord.gg/c7MnfGFGa6) and will be closed.
+
+ - type: textarea
+ attributes:
+ label: "Feature description"
+ description: >
+ This could include new topics or improving any existing implementations.
+ validations:
+ required: true
diff --git a/.github/ISSUE_TEMPLATE/other.yml b/.github/ISSUE_TEMPLATE/other.yml
new file mode 100644
index 000000000000..44d6ff541506
--- /dev/null
+++ b/.github/ISSUE_TEMPLATE/other.yml
@@ -0,0 +1,19 @@
+name: Other
+description: Use this for any other issues. PLEASE do not create blank issues
+labels: ["awaiting triage"]
+body:
+ - type: textarea
+ id: issuedescription
+ attributes:
+ label: What would you like to share?
+ description: Provide a clear and concise explanation of your issue.
+ validations:
+ required: true
+
+ - type: textarea
+ id: extrainfo
+ attributes:
+ label: Additional information
+ description: Is there anything else we should know about this issue?
+ validations:
+ required: false
diff --git a/.github/dependabot.yml b/.github/dependabot.yml
new file mode 100644
index 000000000000..15e494ec867e
--- /dev/null
+++ b/.github/dependabot.yml
@@ -0,0 +1,8 @@
+# Keep GitHub Actions up to date with Dependabot...
+# https://docs.github.com/en/code-security/dependabot/working-with-dependabot/keeping-your-actions-up-to-date-with-dependabot
+version: 2
+updates:
+ - package-ecosystem: "github-actions"
+ directory: "/"
+ schedule:
+ interval: "daily"
diff --git a/.github/pull_request_template.md b/.github/pull_request_template.md
index 103ecf7c288a..e2ae0966cda5 100644
--- a/.github/pull_request_template.md
+++ b/.github/pull_request_template.md
@@ -1,12 +1,13 @@
-### **Describe your change:**
+### Describe your change:
* [ ] Add an algorithm?
* [ ] Fix a bug or typo in an existing algorithm?
+* [ ] Add or change doctests? -- Note: Please avoid changing both code and tests in a single pull request.
* [ ] Documentation change?
-### **Checklist:**
+### Checklist:
* [ ] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [ ] This pull request is all my own work -- I have not plagiarized.
* [ ] I know that pull requests will not be merged if they fail the automated tests.
@@ -16,5 +17,5 @@
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
-* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
-* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
+* [ ] All new algorithms include at least one URL that points to Wikipedia or another similar explanation.
+* [ ] If this pull request resolves one or more open issues then the description above includes the issue number(s) with a [closing keyword](https://docs.github.com/en/issues/tracking-your-work-with-issues/linking-a-pull-request-to-an-issue): "Fixes #ISSUE-NUMBER".
diff --git a/.github/stale.yml b/.github/stale.yml
index 36ca56266b26..0939e1f223ff 100644
--- a/.github/stale.yml
+++ b/.github/stale.yml
@@ -45,7 +45,7 @@ pulls:
closeComment: >
Please reopen this pull request once you commit the changes requested
or make improvements on the code. If this is not the case and you need
- some help, feel free to seek help from our [Gitter](https://gitter.im/TheAlgorithms)
+ some help, feel free to seek help from our [Gitter](https://gitter.im/TheAlgorithms/community)
or ping one of the reviewers. Thank you for your contributions!
issues:
@@ -59,5 +59,5 @@ issues:
closeComment: >
Please reopen this issue once you add more information and updates here.
If this is not the case and you need some help, feel free to seek help
- from our [Gitter](https://gitter.im/TheAlgorithms) or ping one of the
+ from our [Gitter](https://gitter.im/TheAlgorithms/community) or ping one of the
reviewers. Thank you for your contributions!
diff --git a/.github/workflows/build.yml b/.github/workflows/build.yml
index 2ffc2aa293b0..50ed02bb337c 100644
--- a/.github/workflows/build.yml
+++ b/.github/workflows/build.yml
@@ -9,20 +9,46 @@ jobs:
build:
runs-on: ubuntu-latest
steps:
- - uses: actions/checkout@v2
- - uses: actions/setup-python@v2
+ - uses: actions/checkout@v7
+ - uses: astral-sh/setup-uv@v7
with:
- python-version: "3.9"
- - uses: actions/cache@v2
+ enable-cache: true
+ cache-dependency-glob: uv.lock
+ - uses: actions/setup-python@v7
with:
- path: ~/.cache/pip
- key: ${{ runner.os }}-pip-${{ hashFiles('requirements.txt') }}
- - name: Install dependencies
- run: |
- python -m pip install --upgrade pip setuptools six wheel
- python -m pip install mypy pytest-cov -r requirements.txt
- - run: mypy .
+ python-version-file: .python-version
+ allow-prereleases: true
+ - run: uv sync --group=test
- name: Run tests
- run: pytest --doctest-modules --ignore=project_euler/ --ignore=scripts/ --cov-report=term-missing:skip-covered --cov=. .
+ # opencv-python is gated out on 3.14t (no cp314t wheel yet), so skip the
+ # files that import cv2. Pure-Python algorithms in computer_vision/ and
+ # data_compression/ still run; digital_image_processing/ is almost entirely
+ # cv2-based so it is skipped as a tree. Re-enable when a cp314t wheel ships.
+ # --ignore-gil-enabled: some compiled deps (sklearn, xgboost, ...) don't
+ # yet ship the Py_mod_gil slot, so importing them re-enables the GIL under
+ # 3.14t. That's an upstream-wheel gap, not our code; the flag lets the suite
+ # run anyway and pytest-run-parallel still reports which tests are not
+ # thread-safe. Drop the flag once the scientific stack ships free-threaded wheels.
+ # qiskit is likewise gated out of the 3.14t deps (Qiskit/qiskit#16893), so the
+ # single file that imports it (quantum/q_fourier_transform.py) is skipped too.
+ run: uv run --with=pytest-run-parallel pytest
+ --iterations=8 --parallel-threads=auto --ignore-gil-enabled
+ --ignore=computer_vision/cnn_classification.py
+ --ignore=computer_vision/flip_augmentation.py
+ --ignore=computer_vision/harris_corner.py
+ --ignore=computer_vision/mosaic_augmentation.py
+ --ignore=data_compression/peak_signal_to_noise_ratio.py
+ --ignore=digital_image_processing/
+ --ignore=docs/conf.py
+ --ignore=dynamic_programming/k_means_clustering_tensorflow.py
+ --ignore=machine_learning/lstm/lstm_prediction.py
+ --ignore=neural_network/input_data.py
+ --ignore=project_euler/
+ --ignore=quantum/q_fourier_transform.py
+ --ignore=scripts/validate_solutions.py
+ --ignore=web_programming/current_stock_price.py
+ --ignore=web_programming/fetch_anime_and_play.py
+ --cov-report=term-missing:skip-covered
+ --cov=. .
- if: ${{ success() }}
run: scripts/build_directory_md.py 2>&1 | tee DIRECTORY.md
diff --git a/.github/workflows/devcontainer_ci.yml b/.github/workflows/devcontainer_ci.yml
new file mode 100644
index 000000000000..bdc1c904abab
--- /dev/null
+++ b/.github/workflows/devcontainer_ci.yml
@@ -0,0 +1,21 @@
+name: Test DevContainer Build
+
+on:
+ push:
+ paths:
+ - ".devcontainer/**"
+ - ".github/workflows/devcontainer_ci.yml"
+ pull_request:
+ paths:
+ - ".devcontainer/**"
+ - ".github/workflows/devcontainer_ci.yml"
+
+jobs:
+ build:
+ runs-on: ubuntu-latest
+ steps:
+ - uses: actions/checkout@v7
+ - uses: devcontainers/ci@v0.3
+ with:
+ push: never
+ runCmd: "true"
diff --git a/.github/workflows/directory_writer.yml b/.github/workflows/directory_writer.yml
index be8154a32696..93864635bc04 100644
--- a/.github/workflows/directory_writer.yml
+++ b/.github/workflows/directory_writer.yml
@@ -3,16 +3,21 @@
name: directory_writer
on: [push]
jobs:
- build:
+ directory_writer:
runs-on: ubuntu-latest
steps:
- - uses: actions/checkout@v1 # v1, NOT v2
- - uses: actions/setup-python@v2
+ - uses: actions/checkout@v7
+ with:
+ fetch-depth: 0
+ - uses: actions/setup-python@v7
+ with:
+ python-version-file: .python-version
+ allow-prereleases: true
- name: Write DIRECTORY.md
run: |
scripts/build_directory_md.py 2>&1 | tee DIRECTORY.md
- git config --global user.name github-actions
- git config --global user.email '${GITHUB_ACTOR}@users.noreply.github.com'
+ git config --global user.name "$GITHUB_ACTOR"
+ git config --global user.email "$GITHUB_ACTOR@users.noreply.github.com"
git remote set-url origin https://x-access-token:${{ secrets.GITHUB_TOKEN }}@github.com/$GITHUB_REPOSITORY
- name: Update DIRECTORY.md
run: |
diff --git a/.github/workflows/pre-commit.yml b/.github/workflows/pre-commit.yml
deleted file mode 100644
index 27a5a97c0b6c..000000000000
--- a/.github/workflows/pre-commit.yml
+++ /dev/null
@@ -1,22 +0,0 @@
-name: pre-commit
-
-on: [push, pull_request]
-
-jobs:
- pre-commit:
- runs-on: ubuntu-latest
- steps:
- - uses: actions/checkout@v2
- - uses: actions/cache@v2
- with:
- path: |
- ~/.cache/pre-commit
- ~/.cache/pip
- key: ${{ runner.os }}-pre-commit-${{ hashFiles('.pre-commit-config.yaml') }}
- - uses: actions/setup-python@v2
- - uses: psf/black@21.4b0
- - name: Install pre-commit
- run: |
- python -m pip install --upgrade pip
- python -m pip install --upgrade pre-commit
- - run: pre-commit run --verbose --all-files --show-diff-on-failure
diff --git a/.github/workflows/project_euler.yml b/.github/workflows/project_euler.yml
index 995295fcaa9a..de157aea1fb6 100644
--- a/.github/workflows/project_euler.yml
+++ b/.github/workflows/project_euler.yml
@@ -14,22 +14,24 @@ jobs:
project-euler:
runs-on: ubuntu-latest
steps:
- - uses: actions/checkout@v2
- - uses: actions/setup-python@v2
- - name: Install pytest and pytest-cov
- run: |
- python -m pip install --upgrade pip
- python -m pip install --upgrade pytest pytest-cov
- - run: pytest --doctest-modules --cov-report=term-missing:skip-covered --cov=project_euler/ project_euler/
+ - uses: actions/checkout@v7
+ - uses: astral-sh/setup-uv@v7
+ - uses: actions/setup-python@v7
+ with:
+ python-version-file: .python-version
+ allow-prereleases: true
+ - run: uv sync --group=euler-validate --group=test
+ - run: uv run pytest --doctest-modules --cov-report=term-missing:skip-covered --cov=project_euler/ project_euler/
validate-solutions:
runs-on: ubuntu-latest
steps:
- - uses: actions/checkout@v2
- - uses: actions/setup-python@v2
- - name: Install pytest and requests
- run: |
- python -m pip install --upgrade pip
- python -m pip install --upgrade pytest requests
- - run: pytest scripts/validate_solutions.py
+ - uses: actions/checkout@v7
+ - uses: astral-sh/setup-uv@v7
+ - uses: actions/setup-python@v7
+ with:
+ python-version-file: .python-version
+ allow-prereleases: true
+ - run: uv sync --group=euler-validate --group=test
+ - run: uv run pytest scripts/validate_solutions.py
env:
GITHUB_TOKEN: ${{ secrets.GITHUB_TOKEN }}
diff --git a/.github/workflows/ruff.yml b/.github/workflows/ruff.yml
new file mode 100644
index 000000000000..d665d0fb9266
--- /dev/null
+++ b/.github/workflows/ruff.yml
@@ -0,0 +1,16 @@
+# https://beta.ruff.rs
+name: ruff
+on:
+ push:
+ branches:
+ - master
+ pull_request:
+ branches:
+ - master
+jobs:
+ ruff:
+ runs-on: ubuntu-latest
+ steps:
+ - uses: actions/checkout@v7
+ - uses: astral-sh/setup-uv@v7
+ - run: uvx ruff check --output-format=github .
diff --git a/.github/workflows/sphinx.yml b/.github/workflows/sphinx.yml
new file mode 100644
index 000000000000..41844f74669c
--- /dev/null
+++ b/.github/workflows/sphinx.yml
@@ -0,0 +1,50 @@
+name: sphinx
+
+on:
+ # Triggers the workflow on push or pull request events but only for the "master" branch
+ push:
+ branches: ["master"]
+ pull_request:
+ branches: ["master"]
+ # Or manually from the Actions tab
+ workflow_dispatch:
+
+# Sets permissions of the GITHUB_TOKEN to allow deployment to GitHub Pages
+permissions:
+ contents: read
+ pages: write
+ id-token: write
+
+# Allow only one concurrent deployment, skipping runs queued between the run in-progress and latest queued.
+# However, do NOT cancel in-progress runs as we want to allow these production deployments to complete.
+concurrency:
+ group: "pages"
+ cancel-in-progress: false
+
+jobs:
+ build_docs:
+ runs-on: ubuntu-24.04-arm
+ steps:
+ - uses: actions/checkout@v7
+ - uses: astral-sh/setup-uv@v7
+ - uses: actions/setup-python@v7
+ with:
+ python-version-file: .python-version
+ allow-prereleases: true
+ - run: uv sync --group=docs
+ - uses: actions/configure-pages@v6
+ - run: uv run sphinx-build -c docs . docs/_build/html
+ - uses: actions/upload-pages-artifact@v5
+ with:
+ path: docs/_build/html
+
+ deploy_docs:
+ environment:
+ name: github-pages
+ url: ${{ steps.deployment.outputs.page_url }}
+ if: github.event_name != 'pull_request'
+ needs: build_docs
+ runs-on: ubuntu-latest
+ steps:
+ - uses: actions/deploy-pages@v5
+ id: deployment
diff --git a/.gitignore b/.gitignore
index 574cdf312836..192f37798f5d 100644
--- a/.gitignore
+++ b/.gitignore
@@ -73,7 +73,6 @@ target/
.ipynb_checkpoints
# pyenv
-.python-version
# celery beat schedule file
celerybeat-schedule
@@ -107,3 +106,4 @@ venv.bak/
.idea
.try
.vscode/
+.vs/
diff --git a/.pre-commit-config.yaml b/.pre-commit-config.yaml
index b666e88aa162..f33521cc5900 100644
--- a/.pre-commit-config.yaml
+++ b/.pre-commit-config.yaml
@@ -1,56 +1,44 @@
+ci:
+ autoupdate_schedule: monthly
+ # uv-lock resolves dependencies from PyPI, but pre-commit.ci runs hooks with no
+ # network access, so it fails there. Skip it on pre-commit.ci; it still runs locally.
+ skip: [uv-lock]
+
repos:
- repo: https://github.com/pre-commit/pre-commit-hooks
- rev: v3.4.0
+ rev: v6.0.0
hooks:
- id: check-executables-have-shebangs
+ - id: check-toml
- id: check-yaml
- id: end-of-file-fixer
types: [python]
- id: trailing-whitespace
- exclude: |
- (?x)^(
- data_structures/heap/binomial_heap.py
- )$
- id: requirements-txt-fixer
- - repo: https://github.com/psf/black
- rev: 21.4b0
- hooks:
- - id: black
- - repo: https://github.com/PyCQA/isort
- rev: 5.8.0
- hooks:
- - id: isort
- args:
- - --profile=black
- - repo: https://gitlab.com/pycqa/flake8
- rev: 3.9.1
- hooks:
- - id: flake8
- args:
- - --ignore=E203,W503
- - --max-complexity=25
- - --max-line-length=88
-# FIXME: fix mypy errors and then uncomment this
-# - repo: https://github.com/pre-commit/mirrors-mypy
-# rev: v0.782
-# hooks:
-# - id: mypy
-# args:
-# - --ignore-missing-imports
+
+ - repo: https://github.com/MarcoGorelli/auto-walrus
+ rev: 0.4.1
+ hooks:
+ - id: auto-walrus
+
- repo: https://github.com/codespell-project/codespell
- rev: v2.0.0
+ rev: v2.4.3
hooks:
- id: codespell
- args:
- - --ignore-words-list=ans,crate,fo,followings,hist,iff,mater,secant,som,tim
- - --skip="./.*,./strings/dictionary.txt,./strings/words.txt,./project_euler/problem_022/p022_names.txt"
- - --quiet-level=2
- exclude: |
- (?x)^(
- strings/dictionary.txt |
- strings/words.txt |
- project_euler/problem_022/p022_names.txt
- )$
+ additional_dependencies:
+ - tomli
+
+ - repo: https://github.com/astral-sh/ruff-pre-commit
+ rev: v0.16.5
+ hooks:
+ - id: ruff-check
+ - id: ruff-format
+
+ - repo: https://github.com/tox-dev/pyproject-fmt
+ rev: v2.28.1
+ hooks:
+ - id: pyproject-fmt
+
- repo: local
hooks:
- id: validate-filenames
@@ -58,3 +46,29 @@ repos:
entry: ./scripts/validate_filenames.py
language: script
pass_filenames: false
+
+ - repo: https://github.com/astral-sh/uv-pre-commit
+ rev: 0.12.7
+ hooks:
+ - id: uv-lock
+
+ - repo: https://github.com/abravalheri/validate-pyproject
+ rev: "0.26"
+ hooks:
+ - id: validate-pyproject
+
+ # - repo: https://github.com/pre-commit/mirrors-mypy
+ # rev: v1.20.0
+ # hooks:
+ # - id: mypy
+ # args:
+ # - --explicit-package-bases
+ # - --ignore-missing-imports
+ # - --install-types
+ # - --non-interactive
+
+ - repo: https://github.com/pre-commit/mirrors-prettier
+ rev: v4.0.0-alpha.8
+ hooks:
+ - id: prettier
+ types_or: [toml, yaml]
diff --git a/.python-version b/.python-version
new file mode 100644
index 000000000000..a469d8fe8548
--- /dev/null
+++ b/.python-version
@@ -0,0 +1 @@
+3.14t
diff --git a/AGENTS.md b/AGENTS.md
new file mode 100644
index 000000000000..1846b12d0efd
--- /dev/null
+++ b/AGENTS.md
@@ -0,0 +1,62 @@
+# AGENTS.md
+
+Guidance for AI coding agents (and their humans) contributing to
+**TheAlgorithms/Python**. This complements — and never overrides —
+[`CONTRIBUTING.md`](CONTRIBUTING.md). Read that first.
+
+This repository is educational: implementations should be clear and correct
+rather than maximally optimized. Every change goes through CI and the
+`algorithms-keeper` bot, both of which reject non-conforming PRs automatically.
+
+## Before opening a pull request
+
+- **Check at least one box in the PR description.** The `algorithms-keeper`
+ bot **closes any PR whose "Describe your change" section has no checked
+ box** (`* [x]`). Fill in the template that ships in
+ `.github/pull_request_template.md` and tick every item that applies before
+ you submit — this is the single most common reason automated PRs get closed.
+- **One algorithm file per PR.** Split unrelated changes into separate PRs to
+ keep review focused.
+- **Don't change code and its doctests in the same PR.** If you're only
+ updating tests, say so and touch nothing else.
+
+## Code conventions (enforced by CI)
+
+- **Formatting & linting:** `ruff` (`uvx ruff check .` and `uvx ruff format .`).
+ Run `uvx pre-commit run --all-files` locally to catch everything CI will.
+- **Type hints:** annotate every function parameter and return value with
+ [type hints](https://docs.python.org/3/library/typing.html).
+- **Doctests:** every function needs at least one
+ [doctest](https://docs.python.org/3/library/doctest.html) that passes under
+ `python -m doctest -v your_file.py` (and `pytest`).
+- **Naming:** filenames are all-lowercase with underscores (no spaces or
+ dashes); functions and variables follow standard Python naming.
+- **Placement:** new files go inside an existing directory.
+- **References:** new algorithms include a URL to Wikipedia or a comparable
+ explanation.
+
+## Running the suite locally
+
+This project is managed with [`uv`](https://docs.astral.sh/uv/) — there is no
+`requirements.txt`. Dependencies live in `pyproject.toml`/`uv.lock`, and `uvx`
+runs a tool in a throwaway environment without polluting yours:
+
+```bash
+uvx pre-commit run --all-files # ruff, formatting, hooks
+uvx pytest your_module/your_file.py --doctest-modules
+```
+
+(`uv run pytest ...` works too if you'd rather use the project's locked
+environment.)
+
+Some directories are intentionally skipped in CI (`--ignore` entries in
+`.github/workflows/build.yml`), usually because a heavy dependency lacks a
+wheel for the CPython version the repo currently targets. Check that list
+before assuming a file is untested.
+
+## Good agent behavior
+
+- Keep diffs minimal and scoped to the stated change.
+- Preserve existing style and structure; prefer clarity over cleverness.
+- Never fabricate doctest output — run it and paste the real result.
+- If CI is red, read the log and fix the cause rather than re-running blindly.
diff --git a/CONTRIBUTING.md b/CONTRIBUTING.md
index 13d330a90dc5..ec4c7a275932 100644
--- a/CONTRIBUTING.md
+++ b/CONTRIBUTING.md
@@ -2,20 +2,20 @@
## Before contributing
-Welcome to [TheAlgorithms/Python](https://github.com/TheAlgorithms/Python)! Before sending your pull requests, make sure that you __read the whole guidelines__. If you have any doubt on the contributing guide, please feel free to [state it clearly in an issue](https://github.com/TheAlgorithms/Python/issues/new) or ask the community in [Gitter](https://gitter.im/TheAlgorithms).
+Welcome to [TheAlgorithms/Python](https://github.com/TheAlgorithms/Python)! Before submitting your pull requests, please ensure that you __read the whole guidelines__. If you have any doubts about the contributing guide, please feel free to [state it clearly in an issue](https://github.com/TheAlgorithms/Python/issues/new) or ask the community on [Gitter](https://gitter.im/TheAlgorithms/community).
## Contributing
### Contributor
-We are very happy that you consider implementing algorithms and data structure for others! This repository is referenced and used by learners from all over the globe. Being one of our contributors, you agree and confirm that:
+We are delighted that you are considering implementing algorithms and data structures for others! This repository is referenced and used by learners from all over the globe. By being one of our contributors, you agree and confirm that:
-- You did your work - no plagiarism allowed
+- You did your work - no plagiarism allowed.
- Any plagiarized work will not be merged.
-- Your work will be distributed under [MIT License](LICENSE.md) once your pull request is merged
-- You submitted work fulfils or mostly fulfils our styles and standards
+- Your work will be distributed under [MIT License](LICENSE.md) once your pull request is merged.
+- Your submitted work fulfills or mostly fulfills our styles and standards.
-__New implementation__ is welcome! For example, new solutions for a problem, different representations for a graph data structure or algorithm designs with different complexity but __identical implementation__ of an existing implementation is not allowed. Please check whether the solution is already implemented or not before submitting your pull request.
+__New implementation__ is welcome! For example, new solutions for a problem, different representations for a graph data structure or algorithm designs with different complexity, but __identical implementation__ of an existing implementation is not allowed. Please check whether the solution is already implemented or not before submitting your pull request.
__Improving comments__ and __writing proper tests__ are also highly welcome.
@@ -23,9 +23,20 @@ __Improving comments__ and __writing proper tests__ are also highly welcome.
We appreciate any contribution, from fixing a grammar mistake in a comment to implementing complex algorithms. Please read this section if you are contributing your work.
-Your contribution will be tested by our [automated testing on Travis CI](https://travis-ci.org/TheAlgorithms/Python/pull_requests) to save time and mental energy. After you have submitted your pull request, you should see the Travis tests start to run at the bottom of your submission page. If those tests fail, then click on the ___details___ button try to read through the Travis output to understand the failure. If you do not understand, please leave a comment on your submission page and a community member will try to help.
+Your contribution will be tested by our [automated testing on GitHub Actions](https://github.com/TheAlgorithms/Python/actions) to save time and mental energy. After you have submitted your pull request, you should see the GitHub Actions tests start to run at the bottom of your submission page. If those tests fail, then click on the ___details___ button to read through the GitHub Actions output to understand the failure. If you do not understand, please leave a comment on your submission page and a community member will try to help.
-Please help us keep our issue list small by adding fixes: #{$ISSUE_NO} to the commit message of pull requests that resolve open issues. GitHub will use this tag to auto close the issue when the PR is merged.
+#### Issues
+
+If you are interested in resolving an [open issue](https://github.com/TheAlgorithms/Python/issues), simply make a pull request with your proposed fix. __We do not assign issues in this repo__ so please do not ask for permission to work on an issue.
+
+__Do not__ create an issue to contribute an algorithm. Please submit a pull request instead.
+
+Please help us keep our issue list small by adding `Fixes #{$ISSUE_NUMBER}` to the description of pull requests that resolve open issues.
+For example, if your pull request fixes issue #10, then please add the following to its description:
+```
+Fixes #10
+```
+GitHub will use this tag to [auto-close the issue](https://docs.github.com/en/issues/tracking-your-work-with-issues/linking-a-pull-request-to-an-issue) if and when the PR is merged.
#### What is an Algorithm?
@@ -47,13 +58,13 @@ Algorithms should:
* contain doctests that test both valid and erroneous input values
* return all calculation results instead of printing or plotting them
-Algorithms in this repo should not be how-to examples for existing Python packages. Instead, they should perform internal calculations or manipulations to convert input values into different output values. Those calculations or manipulations can use data types, classes, or functions of existing Python packages but each algorithm in this repo should add unique value.
+Algorithms in this repo should not be how-to examples for existing Python packages. Instead, they should perform internal calculations or manipulations to convert input values into different output values. Those calculations or manipulations can use data types, classes, or functions of existing Python packages but each algorithm in this repo should add unique value.
#### Pre-commit plugin
Use [pre-commit](https://pre-commit.com/#installation) to automatically format your code to match our coding style:
```bash
-python3 -m pip install pre-commit # required only once
+python3 -m pip install pre-commit # only required the first time
pre-commit install
```
That's it! The plugin will run every time you commit any changes. If there are any errors found during the run, fix them and commit those changes. You can even run the plugin manually on all files:
@@ -66,8 +77,8 @@ pre-commit run --all-files --show-diff-on-failure
We want your work to be readable by others; therefore, we encourage you to note the following:
-- Please write in Python 3.9+. For instance: `print()` is a function in Python 3 so `print "Hello"` will *not* work but `print("Hello")` will.
-- Please focus hard on naming of functions, classes, and variables. Help your reader by using __descriptive names__ that can help you to remove redundant comments.
+- Please write in Python 3.13+. For instance: `print()` is a function in Python 3 so `print "Hello"` will *not* work but `print("Hello")` will.
+- Please focus hard on the naming of functions, classes, and variables. Help your reader by using __descriptive names__ that can help you to remove redundant comments.
- Single letter variable names are *old school* so please avoid them unless their life only spans a few lines.
- Expand acronyms because `gcd()` is hard to understand but `greatest_common_divisor()` is not.
- Please follow the [Python Naming Conventions](https://pep8.org/#prescriptive-naming-conventions) so variable_names and function_names should be lower_case, CONSTANTS in UPPERCASE, ClassNames should be CamelCase, etc.
@@ -81,14 +92,14 @@ We want your work to be readable by others; therefore, we encourage you to note
black .
```
-- All submissions will need to pass the test `flake8 . --ignore=E203,W503 --max-line-length=88` before they will be accepted so if possible, try this test locally on your Python file(s) before submitting your pull request.
+- All submissions will need to pass the test `ruff .` before they will be accepted so if possible, try this test locally on your Python file(s) before submitting your pull request.
```bash
- python3 -m pip install flake8 # only required the first time
- flake8 . --ignore=E203,W503 --max-line-length=88 --show-source
+ python3 -m pip install ruff # only required the first time
+ ruff check
```
-- Original code submission require docstrings or comments to describe your work.
+- Original code submissions require docstrings or comments to describe your work.
- More on docstrings and comments:
@@ -97,12 +108,12 @@ We want your work to be readable by others; therefore, we encourage you to note
The following are considered to be bad and may be requested to be improved:
```python
- x = x + 2 # increased by 2
+ x = x + 2 # increased by 2
```
This is too trivial. Comments are expected to be explanatory. For comments, you can write them above, on or below a line of code, as long as you are consistent within the same piece of code.
- We encourage you to put docstrings inside your functions but please pay attention to indentation of docstrings. The following is a good example:
+ We encourage you to put docstrings inside your functions but please pay attention to the indentation of docstrings. The following is a good example:
```python
def sum_ab(a, b):
@@ -134,10 +145,10 @@ We want your work to be readable by others; therefore, we encourage you to note
python3 -m doctest -v my_submission.py
```
- The use of the Python builtin `input()` function is __not__ encouraged:
+ The use of the Python built-in `input()` function is __not__ encouraged:
```python
- input('Enter your input:')
+ input("Enter your input:")
# Or even worse...
input = eval(input("Enter your input: "))
```
@@ -148,7 +159,7 @@ We want your work to be readable by others; therefore, we encourage you to note
starting_value = int(input("Please enter a starting value: ").strip())
```
- The use of [Python type hints](https://docs.python.org/3/library/typing.html) is encouraged for function parameters and return values. Our automated testing will run [mypy](http://mypy-lang.org) so run that locally before making your submission.
+ The use of [Python type hints](https://docs.python.org/3/library/typing.html) is encouraged for function parameters and return values. Our automated testing will run [mypy](https://mypy-lang.org) so run that locally before making your submission.
```python
def sum_ab(a: int, b: int) -> int:
@@ -160,7 +171,7 @@ We want your work to be readable by others; therefore, we encourage you to note
- [__List comprehensions and generators__](https://docs.python.org/3/tutorial/datastructures.html#list-comprehensions) are preferred over the use of `lambda`, `map`, `filter`, `reduce` but the important thing is to demonstrate the power of Python in code that is easy to read and maintain.
- Avoid importing external libraries for basic algorithms. Only use those libraries for complicated algorithms.
-- If you need a third party module that is not in the file __requirements.txt__, please add it to that file as part of your submission.
+- If you need a third-party module that is not in the file __requirements.txt__, please add it to that file as part of your submission.
#### Other Requirements for Submissions
- If you are submitting code in the `project_euler/` directory, please also read [the dedicated Guideline](https://github.com/TheAlgorithms/Python/blob/master/project_euler/README.md) before contributing to our Project Euler library.
@@ -170,13 +181,13 @@ We want your work to be readable by others; therefore, we encourage you to note
- If possible, follow the standard *within* the folder you are submitting to.
- If you have modified/added code work, make sure the code compiles before submitting.
- If you have modified/added documentation work, ensure your language is concise and contains no grammar errors.
-- Do not update the README.md or DIRECTORY.md file which will be periodically autogenerated by our Travis CI processes.
+- Do not update the README.md or DIRECTORY.md file which will be periodically autogenerated by our GitHub Actions processes.
- Add a corresponding explanation to [Algorithms-Explanation](https://github.com/TheAlgorithms/Algorithms-Explanation) (Optional but recommended).
-- All submissions will be tested with [__mypy__](http://www.mypy-lang.org) so we encourage to add [__Python type hints__](https://docs.python.org/3/library/typing.html) where it makes sense to do so.
+- All submissions will be tested with [__mypy__](http://www.mypy-lang.org) so we encourage you to add [__Python type hints__](https://docs.python.org/3/library/typing.html) where it makes sense to do so.
- Most importantly,
- __Be consistent in the use of these guidelines when submitting.__
- - __Join__ [Gitter](https://gitter.im/TheAlgorithms) __now!__
+ - __Join__ us on [Discord](https://discord.com/invite/c7MnfGFGa6) and [Gitter](https://gitter.im/TheAlgorithms/community) __now!__
- Happy coding!
Writer [@poyea](https://github.com/poyea), Jun 2019.
diff --git a/DIRECTORY.md b/DIRECTORY.md
index adc9bb9e4699..5bb206e08c0e 100644
--- a/DIRECTORY.md
+++ b/DIRECTORY.md
@@ -1,947 +1,1425 @@
-## Arithmetic Analysis
- * [Bisection](https://github.com/TheAlgorithms/Python/blob/master/arithmetic_analysis/bisection.py)
- * [Gaussian Elimination](https://github.com/TheAlgorithms/Python/blob/master/arithmetic_analysis/gaussian_elimination.py)
- * [In Static Equilibrium](https://github.com/TheAlgorithms/Python/blob/master/arithmetic_analysis/in_static_equilibrium.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 Forward Interpolation](https://github.com/TheAlgorithms/Python/blob/master/arithmetic_analysis/newton_forward_interpolation.py)
- * [Newton Method](https://github.com/TheAlgorithms/Python/blob/master/arithmetic_analysis/newton_method.py)
- * [Newton Raphson](https://github.com/TheAlgorithms/Python/blob/master/arithmetic_analysis/newton_raphson.py)
- * [Secant Method](https://github.com/TheAlgorithms/Python/blob/master/arithmetic_analysis/secant_method.py)
+## Audio Filters
+ * [Butterworth Filter](audio_filters/butterworth_filter.py)
+ * [Equal Loudness Filter](audio_filters/equal_loudness_filter.py)
+ * [Iir Filter](audio_filters/iir_filter.py)
+ * [Show Response](audio_filters/show_response.py)
## Backtracking
- * [All Combinations](https://github.com/TheAlgorithms/Python/blob/master/backtracking/all_combinations.py)
- * [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)
- * [Coloring](https://github.com/TheAlgorithms/Python/blob/master/backtracking/coloring.py)
- * [Hamiltonian Cycle](https://github.com/TheAlgorithms/Python/blob/master/backtracking/hamiltonian_cycle.py)
- * [Knight Tour](https://github.com/TheAlgorithms/Python/blob/master/backtracking/knight_tour.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)
- * [N Queens Math](https://github.com/TheAlgorithms/Python/blob/master/backtracking/n_queens_math.py)
- * [Rat In Maze](https://github.com/TheAlgorithms/Python/blob/master/backtracking/rat_in_maze.py)
- * [Sudoku](https://github.com/TheAlgorithms/Python/blob/master/backtracking/sudoku.py)
- * [Sum Of Subsets](https://github.com/TheAlgorithms/Python/blob/master/backtracking/sum_of_subsets.py)
+ * [All Combinations](backtracking/all_combinations.py)
+ * [All Permutations](backtracking/all_permutations.py)
+ * [All Subsequences](backtracking/all_subsequences.py)
+ * [Coloring](backtracking/coloring.py)
+ * [Combination Sum](backtracking/combination_sum.py)
+ * [Crossword Puzzle Solver](backtracking/crossword_puzzle_solver.py)
+ * [Generate Parentheses](backtracking/generate_parentheses.py)
+ * [Generate Parentheses Iterative](backtracking/generate_parentheses_iterative.py)
+ * [Hamiltonian Cycle](backtracking/hamiltonian_cycle.py)
+ * [Knight Tour](backtracking/knight_tour.py)
+ * [Match Word Pattern](backtracking/match_word_pattern.py)
+ * [Minimax](backtracking/minimax.py)
+ * [N Queens](backtracking/n_queens.py)
+ * [N Queens Math](backtracking/n_queens_math.py)
+ * [Power Sum](backtracking/power_sum.py)
+ * [Rat In Maze](backtracking/rat_in_maze.py)
+ * [Sudoku](backtracking/sudoku.py)
+ * [Sum Of Subsets](backtracking/sum_of_subsets.py)
+ * [Word Break](backtracking/word_break.py)
+ * [Word Ladder](backtracking/word_ladder.py)
+ * [Word Search](backtracking/word_search.py)
## Bit Manipulation
- * [Binary And Operator](https://github.com/TheAlgorithms/Python/blob/master/bit_manipulation/binary_and_operator.py)
- * [Binary Count Setbits](https://github.com/TheAlgorithms/Python/blob/master/bit_manipulation/binary_count_setbits.py)
- * [Binary Count Trailing Zeros](https://github.com/TheAlgorithms/Python/blob/master/bit_manipulation/binary_count_trailing_zeros.py)
- * [Binary Or Operator](https://github.com/TheAlgorithms/Python/blob/master/bit_manipulation/binary_or_operator.py)
- * [Binary Shifts](https://github.com/TheAlgorithms/Python/blob/master/bit_manipulation/binary_shifts.py)
- * [Binary Twos Complement](https://github.com/TheAlgorithms/Python/blob/master/bit_manipulation/binary_twos_complement.py)
- * [Binary Xor Operator](https://github.com/TheAlgorithms/Python/blob/master/bit_manipulation/binary_xor_operator.py)
- * [Count Number Of One Bits](https://github.com/TheAlgorithms/Python/blob/master/bit_manipulation/count_number_of_one_bits.py)
- * [Reverse Bits](https://github.com/TheAlgorithms/Python/blob/master/bit_manipulation/reverse_bits.py)
- * [Single Bit Manipulation Operations](https://github.com/TheAlgorithms/Python/blob/master/bit_manipulation/single_bit_manipulation_operations.py)
+ * [Binary And Operator](bit_manipulation/binary_and_operator.py)
+ * [Binary Coded Decimal](bit_manipulation/binary_coded_decimal.py)
+ * [Binary Count Setbits](bit_manipulation/binary_count_setbits.py)
+ * [Binary Count Trailing Zeros](bit_manipulation/binary_count_trailing_zeros.py)
+ * [Binary Or Operator](bit_manipulation/binary_or_operator.py)
+ * [Binary Shifts](bit_manipulation/binary_shifts.py)
+ * [Binary Twos Complement](bit_manipulation/binary_twos_complement.py)
+ * [Binary Xor Operator](bit_manipulation/binary_xor_operator.py)
+ * [Bitwise Addition Recursive](bit_manipulation/bitwise_addition_recursive.py)
+ * [Count 1S Brian Kernighan Method](bit_manipulation/count_1s_brian_kernighan_method.py)
+ * [Count Number Of One Bits](bit_manipulation/count_number_of_one_bits.py)
+ * [Excess 3 Code](bit_manipulation/excess_3_code.py)
+ * [Find Previous Power Of Two](bit_manipulation/find_previous_power_of_two.py)
+ * [Find Unique Number](bit_manipulation/find_unique_number.py)
+ * [Gray Code Sequence](bit_manipulation/gray_code_sequence.py)
+ * [Highest Set Bit](bit_manipulation/highest_set_bit.py)
+ * [Index Of Rightmost Set Bit](bit_manipulation/index_of_rightmost_set_bit.py)
+ * [Is Even](bit_manipulation/is_even.py)
+ * [Is Power Of Two](bit_manipulation/is_power_of_two.py)
+ * [Largest Pow Of Two Le Num](bit_manipulation/largest_pow_of_two_le_num.py)
+ * [Missing Number](bit_manipulation/missing_number.py)
+ * [Numbers Different Signs](bit_manipulation/numbers_different_signs.py)
+ * [Power Of 4](bit_manipulation/power_of_4.py)
+ * [Reverse Bits](bit_manipulation/reverse_bits.py)
+ * [Single Bit Manipulation Operations](bit_manipulation/single_bit_manipulation_operations.py)
+ * [Swap All Odd And Even Bits](bit_manipulation/swap_all_odd_and_even_bits.py)
## Blockchain
- * [Chinese Remainder Theorem](https://github.com/TheAlgorithms/Python/blob/master/blockchain/chinese_remainder_theorem.py)
- * [Diophantine Equation](https://github.com/TheAlgorithms/Python/blob/master/blockchain/diophantine_equation.py)
- * [Modular Division](https://github.com/TheAlgorithms/Python/blob/master/blockchain/modular_division.py)
+ * [Diophantine Equation](blockchain/diophantine_equation.py)
## Boolean Algebra
- * [Quine Mc Cluskey](https://github.com/TheAlgorithms/Python/blob/master/boolean_algebra/quine_mc_cluskey.py)
+ * [And Gate](boolean_algebra/and_gate.py)
+ * [Imply Gate](boolean_algebra/imply_gate.py)
+ * [Karnaugh Map Simplification](boolean_algebra/karnaugh_map_simplification.py)
+ * [Multiplexer](boolean_algebra/multiplexer.py)
+ * [Nand Gate](boolean_algebra/nand_gate.py)
+ * [Nimply Gate](boolean_algebra/nimply_gate.py)
+ * [Nor Gate](boolean_algebra/nor_gate.py)
+ * [Not Gate](boolean_algebra/not_gate.py)
+ * [Or Gate](boolean_algebra/or_gate.py)
+ * [Quine Mc Cluskey](boolean_algebra/quine_mc_cluskey.py)
+ * [Xnor Gate](boolean_algebra/xnor_gate.py)
+ * [Xor Gate](boolean_algebra/xor_gate.py)
## Cellular Automata
- * [Conways Game Of Life](https://github.com/TheAlgorithms/Python/blob/master/cellular_automata/conways_game_of_life.py)
- * [Game Of Life](https://github.com/TheAlgorithms/Python/blob/master/cellular_automata/game_of_life.py)
- * [One Dimensional](https://github.com/TheAlgorithms/Python/blob/master/cellular_automata/one_dimensional.py)
+ * [Conways Game Of Life](cellular_automata/conways_game_of_life.py)
+ * [Game Of Life](cellular_automata/game_of_life.py)
+ * [Langtons Ant](cellular_automata/langtons_ant.py)
+ * [Nagel Schrekenberg](cellular_automata/nagel_schrekenberg.py)
+ * [One Dimensional](cellular_automata/one_dimensional.py)
+ * [Wa Tor](cellular_automata/wa_tor.py)
## Ciphers
- * [A1Z26](https://github.com/TheAlgorithms/Python/blob/master/ciphers/a1z26.py)
- * [Affine Cipher](https://github.com/TheAlgorithms/Python/blob/master/ciphers/affine_cipher.py)
- * [Atbash](https://github.com/TheAlgorithms/Python/blob/master/ciphers/atbash.py)
- * [Base16](https://github.com/TheAlgorithms/Python/blob/master/ciphers/base16.py)
- * [Base32](https://github.com/TheAlgorithms/Python/blob/master/ciphers/base32.py)
- * [Base64 Encoding](https://github.com/TheAlgorithms/Python/blob/master/ciphers/base64_encoding.py)
- * [Base85](https://github.com/TheAlgorithms/Python/blob/master/ciphers/base85.py)
- * [Beaufort Cipher](https://github.com/TheAlgorithms/Python/blob/master/ciphers/beaufort_cipher.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)
- * [Decrypt Caesar With Chi Squared](https://github.com/TheAlgorithms/Python/blob/master/ciphers/decrypt_caesar_with_chi_squared.py)
- * [Deterministic Miller Rabin](https://github.com/TheAlgorithms/Python/blob/master/ciphers/deterministic_miller_rabin.py)
- * [Diffie](https://github.com/TheAlgorithms/Python/blob/master/ciphers/diffie.py)
- * [Diffie Hellman](https://github.com/TheAlgorithms/Python/blob/master/ciphers/diffie_hellman.py)
- * [Elgamal Key Generator](https://github.com/TheAlgorithms/Python/blob/master/ciphers/elgamal_key_generator.py)
- * [Enigma Machine2](https://github.com/TheAlgorithms/Python/blob/master/ciphers/enigma_machine2.py)
- * [Hill Cipher](https://github.com/TheAlgorithms/Python/blob/master/ciphers/hill_cipher.py)
- * [Mixed Keyword Cypher](https://github.com/TheAlgorithms/Python/blob/master/ciphers/mixed_keyword_cypher.py)
- * [Mono Alphabetic Ciphers](https://github.com/TheAlgorithms/Python/blob/master/ciphers/mono_alphabetic_ciphers.py)
- * [Morse Code Implementation](https://github.com/TheAlgorithms/Python/blob/master/ciphers/morse_code_implementation.py)
- * [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)
- * [Porta Cipher](https://github.com/TheAlgorithms/Python/blob/master/ciphers/porta_cipher.py)
- * [Rabin Miller](https://github.com/TheAlgorithms/Python/blob/master/ciphers/rabin_miller.py)
- * [Rail Fence Cipher](https://github.com/TheAlgorithms/Python/blob/master/ciphers/rail_fence_cipher.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 Factorization](https://github.com/TheAlgorithms/Python/blob/master/ciphers/rsa_factorization.py)
- * [Rsa Key Generator](https://github.com/TheAlgorithms/Python/blob/master/ciphers/rsa_key_generator.py)
- * [Shuffled Shift Cipher](https://github.com/TheAlgorithms/Python/blob/master/ciphers/shuffled_shift_cipher.py)
- * [Simple Keyword Cypher](https://github.com/TheAlgorithms/Python/blob/master/ciphers/simple_keyword_cypher.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
- * [Burrows Wheeler](https://github.com/TheAlgorithms/Python/blob/master/compression/burrows_wheeler.py)
- * [Huffman](https://github.com/TheAlgorithms/Python/blob/master/compression/huffman.py)
- * [Lempel Ziv](https://github.com/TheAlgorithms/Python/blob/master/compression/lempel_ziv.py)
- * [Lempel Ziv Decompress](https://github.com/TheAlgorithms/Python/blob/master/compression/lempel_ziv_decompress.py)
- * [Peak Signal To Noise Ratio](https://github.com/TheAlgorithms/Python/blob/master/compression/peak_signal_to_noise_ratio.py)
+ * [A1Z26](ciphers/a1z26.py)
+ * [Affine Cipher](ciphers/affine_cipher.py)
+ * [Atbash](ciphers/atbash.py)
+ * [Autokey](ciphers/autokey.py)
+ * [Baconian Cipher](ciphers/baconian_cipher.py)
+ * [Base16](ciphers/base16.py)
+ * [Base32](ciphers/base32.py)
+ * [Base64 Cipher](ciphers/base64_cipher.py)
+ * [Base85](ciphers/base85.py)
+ * [Beaufort Cipher](ciphers/beaufort_cipher.py)
+ * [Bifid](ciphers/bifid.py)
+ * [Brute Force Caesar Cipher](ciphers/brute_force_caesar_cipher.py)
+ * [Caesar Cipher](ciphers/caesar_cipher.py)
+ * [Cryptomath Module](ciphers/cryptomath_module.py)
+ * [Decrypt Caesar With Chi Squared](ciphers/decrypt_caesar_with_chi_squared.py)
+ * [Deterministic Miller Rabin](ciphers/deterministic_miller_rabin.py)
+ * [Diffie](ciphers/diffie.py)
+ * [Diffie Hellman](ciphers/diffie_hellman.py)
+ * [Elgamal Key Generator](ciphers/elgamal_key_generator.py)
+ * [Enigma Machine2](ciphers/enigma_machine2.py)
+ * [Fractionated Morse Cipher](ciphers/fractionated_morse_cipher.py)
+ * [Gronsfeld Cipher](ciphers/gronsfeld_cipher.py)
+ * [Hill Cipher](ciphers/hill_cipher.py)
+ * [Mixed Keyword Cypher](ciphers/mixed_keyword_cypher.py)
+ * [Mono Alphabetic Ciphers](ciphers/mono_alphabetic_ciphers.py)
+ * [Morse Code](ciphers/morse_code.py)
+ * [Onepad Cipher](ciphers/onepad_cipher.py)
+ * [Permutation Cipher](ciphers/permutation_cipher.py)
+ * [Playfair Cipher](ciphers/playfair_cipher.py)
+ * [Polybius](ciphers/polybius.py)
+ * [Porta Cipher](ciphers/porta_cipher.py)
+ * [Rabin Miller](ciphers/rabin_miller.py)
+ * [Rail Fence Cipher](ciphers/rail_fence_cipher.py)
+ * [Rot13](ciphers/rot13.py)
+ * [Rsa Cipher](ciphers/rsa_cipher.py)
+ * [Rsa Factorization](ciphers/rsa_factorization.py)
+ * [Rsa Key Generator](ciphers/rsa_key_generator.py)
+ * [Running Key Cipher](ciphers/running_key_cipher.py)
+ * [Shuffled Shift Cipher](ciphers/shuffled_shift_cipher.py)
+ * [Simple Keyword Cypher](ciphers/simple_keyword_cypher.py)
+ * [Simple Substitution Cipher](ciphers/simple_substitution_cipher.py)
+ * [Transposition Cipher](ciphers/transposition_cipher.py)
+ * [Transposition Cipher Encrypt Decrypt File](ciphers/transposition_cipher_encrypt_decrypt_file.py)
+ * [Trifid Cipher](ciphers/trifid_cipher.py)
+ * [Vernam Cipher](ciphers/vernam_cipher.py)
+ * [Vigenere Cipher](ciphers/vigenere_cipher.py)
+ * [Xor Cipher](ciphers/xor_cipher.py)
## Computer Vision
- * [Harris Corner](https://github.com/TheAlgorithms/Python/blob/master/computer_vision/harris_corner.py)
- * [Mean Threshold](https://github.com/TheAlgorithms/Python/blob/master/computer_vision/mean_threshold.py)
+ * [Cnn Classification](computer_vision/cnn_classification.py)
+ * [Flip Augmentation](computer_vision/flip_augmentation.py)
+ * [Haralick Descriptors](computer_vision/haralick_descriptors.py)
+ * [Harris Corner](computer_vision/harris_corner.py)
+ * [Horn Schunck](computer_vision/horn_schunck.py)
+ * [Intensity Based Segmentation](computer_vision/intensity_based_segmentation.py)
+ * [Mean Threshold](computer_vision/mean_threshold.py)
+ * [Mosaic Augmentation](computer_vision/mosaic_augmentation.py)
+ * [Pooling Functions](computer_vision/pooling_functions.py)
## Conversions
- * [Binary To Decimal](https://github.com/TheAlgorithms/Python/blob/master/conversions/binary_to_decimal.py)
- * [Binary To Octal](https://github.com/TheAlgorithms/Python/blob/master/conversions/binary_to_octal.py)
- * [Decimal To Any](https://github.com/TheAlgorithms/Python/blob/master/conversions/decimal_to_any.py)
- * [Decimal To Binary](https://github.com/TheAlgorithms/Python/blob/master/conversions/decimal_to_binary.py)
- * [Decimal To Binary Recursion](https://github.com/TheAlgorithms/Python/blob/master/conversions/decimal_to_binary_recursion.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)
- * [Hex To Bin](https://github.com/TheAlgorithms/Python/blob/master/conversions/hex_to_bin.py)
- * [Hexadecimal To Decimal](https://github.com/TheAlgorithms/Python/blob/master/conversions/hexadecimal_to_decimal.py)
- * [Molecular Chemistry](https://github.com/TheAlgorithms/Python/blob/master/conversions/molecular_chemistry.py)
- * [Octal To Decimal](https://github.com/TheAlgorithms/Python/blob/master/conversions/octal_to_decimal.py)
- * [Prefix Conversions](https://github.com/TheAlgorithms/Python/blob/master/conversions/prefix_conversions.py)
- * [Rgb Hsv Conversion](https://github.com/TheAlgorithms/Python/blob/master/conversions/rgb_hsv_conversion.py)
- * [Roman Numerals](https://github.com/TheAlgorithms/Python/blob/master/conversions/roman_numerals.py)
- * [Temperature Conversions](https://github.com/TheAlgorithms/Python/blob/master/conversions/temperature_conversions.py)
- * [Weight Conversion](https://github.com/TheAlgorithms/Python/blob/master/conversions/weight_conversion.py)
+ * [Astronomical Length Scale Conversion](conversions/astronomical_length_scale_conversion.py)
+ * [Binary To Decimal](conversions/binary_to_decimal.py)
+ * [Binary To Hexadecimal](conversions/binary_to_hexadecimal.py)
+ * [Binary To Octal](conversions/binary_to_octal.py)
+ * [Convert Number To Words](conversions/convert_number_to_words.py)
+ * [Decimal To Any](conversions/decimal_to_any.py)
+ * [Decimal To Binary](conversions/decimal_to_binary.py)
+ * [Decimal To Hexadecimal](conversions/decimal_to_hexadecimal.py)
+ * [Decimal To Octal](conversions/decimal_to_octal.py)
+ * [Energy Conversions](conversions/energy_conversions.py)
+ * [Excel Title To Column](conversions/excel_title_to_column.py)
+ * [Hex To Bin](conversions/hex_to_bin.py)
+ * [Hexadecimal To Decimal](conversions/hexadecimal_to_decimal.py)
+ * [Ipv4 Conversion](conversions/ipv4_conversion.py)
+ * [Length Conversion](conversions/length_conversion.py)
+ * [Molecular Chemistry](conversions/molecular_chemistry.py)
+ * [Octal To Binary](conversions/octal_to_binary.py)
+ * [Octal To Decimal](conversions/octal_to_decimal.py)
+ * [Octal To Hexadecimal](conversions/octal_to_hexadecimal.py)
+ * [Prefix Conversions](conversions/prefix_conversions.py)
+ * [Prefix Conversions String](conversions/prefix_conversions_string.py)
+ * [Pressure Conversions](conversions/pressure_conversions.py)
+ * [Rectangular To Polar](conversions/rectangular_to_polar.py)
+ * [Rgb Cmyk Conversion](conversions/rgb_cmyk_conversion.py)
+ * [Rgb Hsv Conversion](conversions/rgb_hsv_conversion.py)
+ * [Roman Numerals](conversions/roman_numerals.py)
+ * [Speed Conversions](conversions/speed_conversions.py)
+ * [Temperature Conversions](conversions/temperature_conversions.py)
+ * [Time Conversions](conversions/time_conversions.py)
+ * [Volume Conversions](conversions/volume_conversions.py)
+ * [Weight Conversion](conversions/weight_conversion.py)
+
+## Data Compression
+ * [Burrows Wheeler](data_compression/burrows_wheeler.py)
+ * [Coordinate Compression](data_compression/coordinate_compression.py)
+ * [Huffman](data_compression/huffman.py)
+ * [Lempel Ziv](data_compression/lempel_ziv.py)
+ * [Lempel Ziv Decompress](data_compression/lempel_ziv_decompress.py)
+ * [Lz77](data_compression/lz77.py)
+ * [Peak Signal To Noise Ratio](data_compression/peak_signal_to_noise_ratio.py)
+ * [Run Length Encoding](data_compression/run_length_encoding.py)
## Data Structures
+ * Arrays
+ * [Equilibrium Index In Array](data_structures/arrays/equilibrium_index_in_array.py)
+ * [Find Triplets With 0 Sum](data_structures/arrays/find_triplets_with_0_sum.py)
+ * [Index 2D Array In 1D](data_structures/arrays/index_2d_array_in_1d.py)
+ * [Kth Largest Element](data_structures/arrays/kth_largest_element.py)
+ * [Median Two Array](data_structures/arrays/median_two_array.py)
+ * [Monotonic Array](data_structures/arrays/monotonic_array.py)
+ * [Pairs With Given Sum](data_structures/arrays/pairs_with_given_sum.py)
+ * [Permutations](data_structures/arrays/permutations.py)
+ * [Prefix Sum](data_structures/arrays/prefix_sum.py)
+ * [Product Sum](data_structures/arrays/product_sum.py)
+ * [Rotate Array](data_structures/arrays/rotate_array.py)
+ * [Sparse Table](data_structures/arrays/sparse_table.py)
+ * [Sudoku Solver](data_structures/arrays/sudoku_solver.py)
* Binary Tree
- * [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)
- * [Binary Search Tree](https://github.com/TheAlgorithms/Python/blob/master/data_structures/binary_tree/binary_search_tree.py)
- * [Binary Search Tree Recursive](https://github.com/TheAlgorithms/Python/blob/master/data_structures/binary_tree/binary_search_tree_recursive.py)
- * [Binary Tree Mirror](https://github.com/TheAlgorithms/Python/blob/master/data_structures/binary_tree/binary_tree_mirror.py)
- * [Binary Tree Traversals](https://github.com/TheAlgorithms/Python/blob/master/data_structures/binary_tree/binary_tree_traversals.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)
- * [Lowest Common Ancestor](https://github.com/TheAlgorithms/Python/blob/master/data_structures/binary_tree/lowest_common_ancestor.py)
- * [Merge Two Binary Trees](https://github.com/TheAlgorithms/Python/blob/master/data_structures/binary_tree/merge_two_binary_trees.py)
- * [Non Recursive Segment Tree](https://github.com/TheAlgorithms/Python/blob/master/data_structures/binary_tree/non_recursive_segment_tree.py)
- * [Number Of Possible Binary Trees](https://github.com/TheAlgorithms/Python/blob/master/data_structures/binary_tree/number_of_possible_binary_trees.py)
- * [Red Black Tree](https://github.com/TheAlgorithms/Python/blob/master/data_structures/binary_tree/red_black_tree.py)
- * [Segment Tree](https://github.com/TheAlgorithms/Python/blob/master/data_structures/binary_tree/segment_tree.py)
- * [Segment Tree Other](https://github.com/TheAlgorithms/Python/blob/master/data_structures/binary_tree/segment_tree_other.py)
- * [Treap](https://github.com/TheAlgorithms/Python/blob/master/data_structures/binary_tree/treap.py)
- * [Wavelet Tree](https://github.com/TheAlgorithms/Python/blob/master/data_structures/binary_tree/wavelet_tree.py)
+ * [Avl Tree](data_structures/binary_tree/avl_tree.py)
+ * [Basic Binary Tree](data_structures/binary_tree/basic_binary_tree.py)
+ * [Binary Search Tree](data_structures/binary_tree/binary_search_tree.py)
+ * [Binary Search Tree Recursive](data_structures/binary_tree/binary_search_tree_recursive.py)
+ * [Binary Tree Mirror](data_structures/binary_tree/binary_tree_mirror.py)
+ * [Binary Tree Node Sum](data_structures/binary_tree/binary_tree_node_sum.py)
+ * [Binary Tree Path Sum](data_structures/binary_tree/binary_tree_path_sum.py)
+ * [Binary Tree Traversals](data_structures/binary_tree/binary_tree_traversals.py)
+ * [Diameter Of Binary Tree](data_structures/binary_tree/diameter_of_binary_tree.py)
+ * [Diff Views Of Binary Tree](data_structures/binary_tree/diff_views_of_binary_tree.py)
+ * [Distribute Coins](data_structures/binary_tree/distribute_coins.py)
+ * [Fenwick Tree](data_structures/binary_tree/fenwick_tree.py)
+ * [Flatten Binarytree To Linkedlist](data_structures/binary_tree/flatten_binarytree_to_linkedlist.py)
+ * [Floor And Ceiling](data_structures/binary_tree/floor_and_ceiling.py)
+ * [Inorder Tree Traversal 2022](data_structures/binary_tree/inorder_tree_traversal_2022.py)
+ * [Is Sorted](data_structures/binary_tree/is_sorted.py)
+ * [Is Sum Tree](data_structures/binary_tree/is_sum_tree.py)
+ * [Lazy Segment Tree](data_structures/binary_tree/lazy_segment_tree.py)
+ * [Lowest Common Ancestor](data_structures/binary_tree/lowest_common_ancestor.py)
+ * [Maximum Fenwick Tree](data_structures/binary_tree/maximum_fenwick_tree.py)
+ * [Maximum Sum Bst](data_structures/binary_tree/maximum_sum_bst.py)
+ * [Merge Two Binary Trees](data_structures/binary_tree/merge_two_binary_trees.py)
+ * [Mirror Binary Tree](data_structures/binary_tree/mirror_binary_tree.py)
+ * [Non Recursive Segment Tree](data_structures/binary_tree/non_recursive_segment_tree.py)
+ * [Number Of Possible Binary Trees](data_structures/binary_tree/number_of_possible_binary_trees.py)
+ * [Red Black Tree](data_structures/binary_tree/red_black_tree.py)
+ * [Segment Tree](data_structures/binary_tree/segment_tree.py)
+ * [Segment Tree Other](data_structures/binary_tree/segment_tree_other.py)
+ * [Serialize Deserialize Binary Tree](data_structures/binary_tree/serialize_deserialize_binary_tree.py)
+ * [Symmetric Tree](data_structures/binary_tree/symmetric_tree.py)
+ * [Treap](data_structures/binary_tree/treap.py)
+ * [Wavelet Tree](data_structures/binary_tree/wavelet_tree.py)
* Disjoint Set
- * [Alternate Disjoint Set](https://github.com/TheAlgorithms/Python/blob/master/data_structures/disjoint_set/alternate_disjoint_set.py)
- * [Disjoint Set](https://github.com/TheAlgorithms/Python/blob/master/data_structures/disjoint_set/disjoint_set.py)
+ * [Alternate Disjoint Set](data_structures/disjoint_set/alternate_disjoint_set.py)
+ * [Disjoint Set](data_structures/disjoint_set/disjoint_set.py)
* 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)
+ * [Bloom Filter](data_structures/hashing/bloom_filter.py)
+ * [Double Hash](data_structures/hashing/double_hash.py)
+ * [Hash Map](data_structures/hashing/hash_map.py)
+ * [Hash Table](data_structures/hashing/hash_table.py)
+ * [Hash Table With Linked List](data_structures/hashing/hash_table_with_linked_list.py)
* Number Theory
- * [Prime Numbers](https://github.com/TheAlgorithms/Python/blob/master/data_structures/hashing/number_theory/prime_numbers.py)
- * [Quadratic Probing](https://github.com/TheAlgorithms/Python/blob/master/data_structures/hashing/quadratic_probing.py)
+ * [Prime Numbers](data_structures/hashing/number_theory/prime_numbers.py)
+ * [Quadratic Probing](data_structures/hashing/quadratic_probing.py)
+ * Tests
+ * [Test Hash Map](data_structures/hashing/tests/test_hash_map.py)
* Heap
- * [Binomial Heap](https://github.com/TheAlgorithms/Python/blob/master/data_structures/heap/binomial_heap.py)
- * [Heap](https://github.com/TheAlgorithms/Python/blob/master/data_structures/heap/heap.py)
- * [Heap Generic](https://github.com/TheAlgorithms/Python/blob/master/data_structures/heap/heap_generic.py)
- * [Max Heap](https://github.com/TheAlgorithms/Python/blob/master/data_structures/heap/max_heap.py)
- * [Min Heap](https://github.com/TheAlgorithms/Python/blob/master/data_structures/heap/min_heap.py)
- * [Randomized Heap](https://github.com/TheAlgorithms/Python/blob/master/data_structures/heap/randomized_heap.py)
- * [Skew Heap](https://github.com/TheAlgorithms/Python/blob/master/data_structures/heap/skew_heap.py)
+ * [Binomial Heap](data_structures/heap/binomial_heap.py)
+ * [Heap](data_structures/heap/heap.py)
+ * [Heap Generic](data_structures/heap/heap_generic.py)
+ * [Max Heap](data_structures/heap/max_heap.py)
+ * [Min Heap](data_structures/heap/min_heap.py)
+ * [Randomized Heap](data_structures/heap/randomized_heap.py)
+ * [Skew Heap](data_structures/heap/skew_heap.py)
+ * Kd Tree
+ * [Build Kdtree](data_structures/kd_tree/build_kdtree.py)
+ * Example
+ * [Example Usage](data_structures/kd_tree/example/example_usage.py)
+ * [Hypercube Points](data_structures/kd_tree/example/hypercube_points.py)
+ * [Kd Node](data_structures/kd_tree/kd_node.py)
+ * [Nearest Neighbour Search](data_structures/kd_tree/nearest_neighbour_search.py)
+ * Tests
+ * [Test Kdtree](data_structures/kd_tree/tests/test_kdtree.py)
* Linked List
- * [Circular Linked List](https://github.com/TheAlgorithms/Python/blob/master/data_structures/linked_list/circular_linked_list.py)
- * [Deque Doubly](https://github.com/TheAlgorithms/Python/blob/master/data_structures/linked_list/deque_doubly.py)
- * [Doubly Linked List](https://github.com/TheAlgorithms/Python/blob/master/data_structures/linked_list/doubly_linked_list.py)
- * [Doubly Linked List Two](https://github.com/TheAlgorithms/Python/blob/master/data_structures/linked_list/doubly_linked_list_two.py)
- * [From Sequence](https://github.com/TheAlgorithms/Python/blob/master/data_structures/linked_list/from_sequence.py)
- * [Has Loop](https://github.com/TheAlgorithms/Python/blob/master/data_structures/linked_list/has_loop.py)
- * [Is Palindrome](https://github.com/TheAlgorithms/Python/blob/master/data_structures/linked_list/is_palindrome.py)
- * [Merge Two Lists](https://github.com/TheAlgorithms/Python/blob/master/data_structures/linked_list/merge_two_lists.py)
- * [Middle Element Of Linked List](https://github.com/TheAlgorithms/Python/blob/master/data_structures/linked_list/middle_element_of_linked_list.py)
- * [Print Reverse](https://github.com/TheAlgorithms/Python/blob/master/data_structures/linked_list/print_reverse.py)
- * [Singly Linked List](https://github.com/TheAlgorithms/Python/blob/master/data_structures/linked_list/singly_linked_list.py)
- * [Skip List](https://github.com/TheAlgorithms/Python/blob/master/data_structures/linked_list/skip_list.py)
- * [Swap Nodes](https://github.com/TheAlgorithms/Python/blob/master/data_structures/linked_list/swap_nodes.py)
- * Queue
- * [Circular Queue](https://github.com/TheAlgorithms/Python/blob/master/data_structures/queue/circular_queue.py)
- * [Double Ended Queue](https://github.com/TheAlgorithms/Python/blob/master/data_structures/queue/double_ended_queue.py)
- * [Linked Queue](https://github.com/TheAlgorithms/Python/blob/master/data_structures/queue/linked_queue.py)
- * [Priority Queue Using List](https://github.com/TheAlgorithms/Python/blob/master/data_structures/queue/priority_queue_using_list.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)
+ * [Circular Linked List](data_structures/linked_list/circular_linked_list.py)
+ * [Deque Doubly](data_structures/linked_list/deque_doubly.py)
+ * [Doubly Linked List](data_structures/linked_list/doubly_linked_list.py)
+ * [Doubly Linked List Two](data_structures/linked_list/doubly_linked_list_two.py)
+ * [Floyds Cycle Detection](data_structures/linked_list/floyds_cycle_detection.py)
+ * [From Sequence](data_structures/linked_list/from_sequence.py)
+ * [Has Loop](data_structures/linked_list/has_loop.py)
+ * [Is Palindrome](data_structures/linked_list/is_palindrome.py)
+ * [Merge Two Lists](data_structures/linked_list/merge_two_lists.py)
+ * [Middle Element Of Linked List](data_structures/linked_list/middle_element_of_linked_list.py)
+ * [Print Reverse](data_structures/linked_list/print_reverse.py)
+ * [Reverse K Group](data_structures/linked_list/reverse_k_group.py)
+ * [Rotate To The Right](data_structures/linked_list/rotate_to_the_right.py)
+ * [Singly Linked List](data_structures/linked_list/singly_linked_list.py)
+ * [Skip List](data_structures/linked_list/skip_list.py)
+ * [Swap Nodes](data_structures/linked_list/swap_nodes.py)
+ * Queues
+ * [Circular Queue](data_structures/queues/circular_queue.py)
+ * [Circular Queue Linked List](data_structures/queues/circular_queue_linked_list.py)
+ * [Double Ended Queue](data_structures/queues/double_ended_queue.py)
+ * [Linked Queue](data_structures/queues/linked_queue.py)
+ * [Priority Queue Using List](data_structures/queues/priority_queue_using_list.py)
+ * [Queue By List](data_structures/queues/queue_by_list.py)
+ * [Queue By Two Stacks](data_structures/queues/queue_by_two_stacks.py)
+ * [Queue On Pseudo Stack](data_structures/queues/queue_on_pseudo_stack.py)
* Stacks
- * [Balanced Parentheses](https://github.com/TheAlgorithms/Python/blob/master/data_structures/stacks/balanced_parentheses.py)
- * [Dijkstras Two Stack Algorithm](https://github.com/TheAlgorithms/Python/blob/master/data_structures/stacks/dijkstras_two_stack_algorithm.py)
- * [Evaluate Postfix Notations](https://github.com/TheAlgorithms/Python/blob/master/data_structures/stacks/evaluate_postfix_notations.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)
- * [Linked Stack](https://github.com/TheAlgorithms/Python/blob/master/data_structures/stacks/linked_stack.py)
- * [Next Greater Element](https://github.com/TheAlgorithms/Python/blob/master/data_structures/stacks/next_greater_element.py)
- * [Postfix Evaluation](https://github.com/TheAlgorithms/Python/blob/master/data_structures/stacks/postfix_evaluation.py)
- * [Prefix Evaluation](https://github.com/TheAlgorithms/Python/blob/master/data_structures/stacks/prefix_evaluation.py)
- * [Stack](https://github.com/TheAlgorithms/Python/blob/master/data_structures/stacks/stack.py)
- * [Stack Using Dll](https://github.com/TheAlgorithms/Python/blob/master/data_structures/stacks/stack_using_dll.py)
- * [Stock Span Problem](https://github.com/TheAlgorithms/Python/blob/master/data_structures/stacks/stock_span_problem.py)
+ * [Balanced Parentheses](data_structures/stacks/balanced_parentheses.py)
+ * [Dijkstras Two Stack Algorithm](data_structures/stacks/dijkstras_two_stack_algorithm.py)
+ * [Infix To Postfix Conversion](data_structures/stacks/infix_to_postfix_conversion.py)
+ * [Infix To Prefix Conversion](data_structures/stacks/infix_to_prefix_conversion.py)
+ * [Largest Rectangle Histogram](data_structures/stacks/largest_rectangle_histogram.py)
+ * [Lexicographical Numbers](data_structures/stacks/lexicographical_numbers.py)
+ * [Next Greater Element](data_structures/stacks/next_greater_element.py)
+ * [Postfix Evaluation](data_structures/stacks/postfix_evaluation.py)
+ * [Prefix Evaluation](data_structures/stacks/prefix_evaluation.py)
+ * [Stack](data_structures/stacks/stack.py)
+ * [Stack Using Two Queues](data_structures/stacks/stack_using_two_queues.py)
+ * [Stack With Doubly Linked List](data_structures/stacks/stack_with_doubly_linked_list.py)
+ * [Stack With Singly Linked List](data_structures/stacks/stack_with_singly_linked_list.py)
+ * [Stock Span Problem](data_structures/stacks/stock_span_problem.py)
+ * Suffix Tree
+ * Example
+ * [Example Usage](data_structures/suffix_tree/example/example_usage.py)
+ * [Suffix Tree](data_structures/suffix_tree/suffix_tree.py)
+ * [Suffix Tree Node](data_structures/suffix_tree/suffix_tree_node.py)
+ * Tests
+ * [Test Suffix Tree](data_structures/suffix_tree/tests/test_suffix_tree.py)
* Trie
- * [Trie](https://github.com/TheAlgorithms/Python/blob/master/data_structures/trie/trie.py)
+ * [Radix Tree](data_structures/trie/radix_tree.py)
+ * [Trie](data_structures/trie/trie.py)
## Digital Image Processing
- * [Change Brightness](https://github.com/TheAlgorithms/Python/blob/master/digital_image_processing/change_brightness.py)
- * [Change Contrast](https://github.com/TheAlgorithms/Python/blob/master/digital_image_processing/change_contrast.py)
- * [Convert To Negative](https://github.com/TheAlgorithms/Python/blob/master/digital_image_processing/convert_to_negative.py)
+ * [Change Brightness](digital_image_processing/change_brightness.py)
+ * [Change Contrast](digital_image_processing/change_contrast.py)
+ * [Convert To Negative](digital_image_processing/convert_to_negative.py)
* Dithering
- * [Burkes](https://github.com/TheAlgorithms/Python/blob/master/digital_image_processing/dithering/burkes.py)
+ * [Burkes](digital_image_processing/dithering/burkes.py)
* Edge Detection
- * [Canny](https://github.com/TheAlgorithms/Python/blob/master/digital_image_processing/edge_detection/canny.py)
+ * [Canny](digital_image_processing/edge_detection/canny.py)
* Filters
- * [Bilateral Filter](https://github.com/TheAlgorithms/Python/blob/master/digital_image_processing/filters/bilateral_filter.py)
- * [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)
- * [Median Filter](https://github.com/TheAlgorithms/Python/blob/master/digital_image_processing/filters/median_filter.py)
- * [Sobel Filter](https://github.com/TheAlgorithms/Python/blob/master/digital_image_processing/filters/sobel_filter.py)
+ * [Bilateral Filter](digital_image_processing/filters/bilateral_filter.py)
+ * [Convolve](digital_image_processing/filters/convolve.py)
+ * [Gabor Filter](digital_image_processing/filters/gabor_filter.py)
+ * [Gaussian Filter](digital_image_processing/filters/gaussian_filter.py)
+ * [Laplacian Filter](digital_image_processing/filters/laplacian_filter.py)
+ * [Local Binary Pattern](digital_image_processing/filters/local_binary_pattern.py)
+ * [Median Filter](digital_image_processing/filters/median_filter.py)
+ * [Sobel Filter](digital_image_processing/filters/sobel_filter.py)
* Histogram Equalization
- * [Histogram Stretch](https://github.com/TheAlgorithms/Python/blob/master/digital_image_processing/histogram_equalization/histogram_stretch.py)
- * [Index Calculation](https://github.com/TheAlgorithms/Python/blob/master/digital_image_processing/index_calculation.py)
+ * [Histogram Stretch](digital_image_processing/histogram_equalization/histogram_stretch.py)
+ * [Index Calculation](digital_image_processing/index_calculation.py)
+ * Morphological Operations
+ * [Dilation Operation](digital_image_processing/morphological_operations/dilation_operation.py)
+ * [Erosion Operation](digital_image_processing/morphological_operations/erosion_operation.py)
* Resize
- * [Resize](https://github.com/TheAlgorithms/Python/blob/master/digital_image_processing/resize/resize.py)
+ * [Resize](digital_image_processing/resize/resize.py)
* Rotation
- * [Rotation](https://github.com/TheAlgorithms/Python/blob/master/digital_image_processing/rotation/rotation.py)
- * [Sepia](https://github.com/TheAlgorithms/Python/blob/master/digital_image_processing/sepia.py)
- * [Test Digital Image Processing](https://github.com/TheAlgorithms/Python/blob/master/digital_image_processing/test_digital_image_processing.py)
+ * [Rotation](digital_image_processing/rotation/rotation.py)
+ * [Sepia](digital_image_processing/sepia.py)
+ * [Test Digital Image Processing](digital_image_processing/test_digital_image_processing.py)
## Divide And Conquer
- * [Closest Pair Of Points](https://github.com/TheAlgorithms/Python/blob/master/divide_and_conquer/closest_pair_of_points.py)
- * [Convex Hull](https://github.com/TheAlgorithms/Python/blob/master/divide_and_conquer/convex_hull.py)
- * [Heaps Algorithm](https://github.com/TheAlgorithms/Python/blob/master/divide_and_conquer/heaps_algorithm.py)
- * [Heaps Algorithm Iterative](https://github.com/TheAlgorithms/Python/blob/master/divide_and_conquer/heaps_algorithm_iterative.py)
- * [Inversions](https://github.com/TheAlgorithms/Python/blob/master/divide_and_conquer/inversions.py)
- * [Kth Order Statistic](https://github.com/TheAlgorithms/Python/blob/master/divide_and_conquer/kth_order_statistic.py)
- * [Max Difference Pair](https://github.com/TheAlgorithms/Python/blob/master/divide_and_conquer/max_difference_pair.py)
- * [Max Subarray Sum](https://github.com/TheAlgorithms/Python/blob/master/divide_and_conquer/max_subarray_sum.py)
- * [Mergesort](https://github.com/TheAlgorithms/Python/blob/master/divide_and_conquer/mergesort.py)
- * [Peak](https://github.com/TheAlgorithms/Python/blob/master/divide_and_conquer/peak.py)
- * [Power](https://github.com/TheAlgorithms/Python/blob/master/divide_and_conquer/power.py)
- * [Strassen Matrix Multiplication](https://github.com/TheAlgorithms/Python/blob/master/divide_and_conquer/strassen_matrix_multiplication.py)
+ * [Closest Pair Of Points](divide_and_conquer/closest_pair_of_points.py)
+ * [Convex Hull](divide_and_conquer/convex_hull.py)
+ * [Heaps Algorithm](divide_and_conquer/heaps_algorithm.py)
+ * [Heaps Algorithm Iterative](divide_and_conquer/heaps_algorithm_iterative.py)
+ * [Inversions](divide_and_conquer/inversions.py)
+ * [Kth Order Statistic](divide_and_conquer/kth_order_statistic.py)
+ * [Max Difference Pair](divide_and_conquer/max_difference_pair.py)
+ * [Max Subarray](divide_and_conquer/max_subarray.py)
+ * [Mergesort](divide_and_conquer/mergesort.py)
+ * [Peak](divide_and_conquer/peak.py)
+ * [Power](divide_and_conquer/power.py)
+ * [Strassen Matrix Multiplication](divide_and_conquer/strassen_matrix_multiplication.py)
+
+## Docs
+ * [Conf](docs/conf.py)
## 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)
- * [Catalan Numbers](https://github.com/TheAlgorithms/Python/blob/master/dynamic_programming/catalan_numbers.py)
- * [Climbing Stairs](https://github.com/TheAlgorithms/Python/blob/master/dynamic_programming/climbing_stairs.py)
- * [Edit Distance](https://github.com/TheAlgorithms/Python/blob/master/dynamic_programming/edit_distance.py)
- * [Factorial](https://github.com/TheAlgorithms/Python/blob/master/dynamic_programming/factorial.py)
- * [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)
- * [Fractional Knapsack](https://github.com/TheAlgorithms/Python/blob/master/dynamic_programming/fractional_knapsack.py)
- * [Fractional Knapsack 2](https://github.com/TheAlgorithms/Python/blob/master/dynamic_programming/fractional_knapsack_2.py)
- * [Integer Partition](https://github.com/TheAlgorithms/Python/blob/master/dynamic_programming/integer_partition.py)
- * [Iterating Through Submasks](https://github.com/TheAlgorithms/Python/blob/master/dynamic_programming/iterating_through_submasks.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)
- * [Longest Increasing Subsequence O(Nlogn)](https://github.com/TheAlgorithms/Python/blob/master/dynamic_programming/longest_increasing_subsequence_o(nlogn).py)
- * [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 Non Adjacent Sum](https://github.com/TheAlgorithms/Python/blob/master/dynamic_programming/max_non_adjacent_sum.py)
- * [Max Sub Array](https://github.com/TheAlgorithms/Python/blob/master/dynamic_programming/max_sub_array.py)
- * [Max Sum Contiguous Subsequence](https://github.com/TheAlgorithms/Python/blob/master/dynamic_programming/max_sum_contiguous_subsequence.py)
- * [Minimum Coin Change](https://github.com/TheAlgorithms/Python/blob/master/dynamic_programming/minimum_coin_change.py)
- * [Minimum Cost Path](https://github.com/TheAlgorithms/Python/blob/master/dynamic_programming/minimum_cost_path.py)
- * [Minimum Partition](https://github.com/TheAlgorithms/Python/blob/master/dynamic_programming/minimum_partition.py)
- * [Minimum Steps To One](https://github.com/TheAlgorithms/Python/blob/master/dynamic_programming/minimum_steps_to_one.py)
- * [Optimal Binary Search Tree](https://github.com/TheAlgorithms/Python/blob/master/dynamic_programming/optimal_binary_search_tree.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)
- * [Sum Of Subset](https://github.com/TheAlgorithms/Python/blob/master/dynamic_programming/sum_of_subset.py)
+ * [Abbreviation](dynamic_programming/abbreviation.py)
+ * [All Construct](dynamic_programming/all_construct.py)
+ * [Bitmask](dynamic_programming/bitmask.py)
+ * [Catalan Numbers](dynamic_programming/catalan_numbers.py)
+ * [Climbing Stairs](dynamic_programming/climbing_stairs.py)
+ * [Combination Sum Iv](dynamic_programming/combination_sum_iv.py)
+ * [Edit Distance](dynamic_programming/edit_distance.py)
+ * [Factorial](dynamic_programming/factorial.py)
+ * [Fast Fibonacci](dynamic_programming/fast_fibonacci.py)
+ * [Fibonacci](dynamic_programming/fibonacci.py)
+ * [Fizz Buzz](dynamic_programming/fizz_buzz.py)
+ * [Floyd Warshall](dynamic_programming/floyd_warshall.py)
+ * [Integer Partition](dynamic_programming/integer_partition.py)
+ * [Iterating Through Submasks](dynamic_programming/iterating_through_submasks.py)
+ * [K Means Clustering Tensorflow](dynamic_programming/k_means_clustering_tensorflow.py)
+ * [Knapsack](dynamic_programming/knapsack.py)
+ * [Largest Divisible Subset](dynamic_programming/largest_divisible_subset.py)
+ * [Longest Common Subsequence](dynamic_programming/longest_common_subsequence.py)
+ * [Longest Common Substring](dynamic_programming/longest_common_substring.py)
+ * [Longest Increasing Subsequence](dynamic_programming/longest_increasing_subsequence.py)
+ * [Longest Increasing Subsequence Iterative](dynamic_programming/longest_increasing_subsequence_iterative.py)
+ * [Longest Increasing Subsequence O Nlogn](dynamic_programming/longest_increasing_subsequence_o_nlogn.py)
+ * [Longest Palindromic Subsequence](dynamic_programming/longest_palindromic_subsequence.py)
+ * [Matrix Chain Multiplication](dynamic_programming/matrix_chain_multiplication.py)
+ * [Matrix Chain Order](dynamic_programming/matrix_chain_order.py)
+ * [Max Non Adjacent Sum](dynamic_programming/max_non_adjacent_sum.py)
+ * [Max Product Subarray](dynamic_programming/max_product_subarray.py)
+ * [Max Subarray Sum](dynamic_programming/max_subarray_sum.py)
+ * [Min Distance Up Bottom](dynamic_programming/min_distance_up_bottom.py)
+ * [Minimum Coin Change](dynamic_programming/minimum_coin_change.py)
+ * [Minimum Cost Path](dynamic_programming/minimum_cost_path.py)
+ * [Minimum Partition](dynamic_programming/minimum_partition.py)
+ * [Minimum Size Subarray Sum](dynamic_programming/minimum_size_subarray_sum.py)
+ * [Minimum Squares To Represent A Number](dynamic_programming/minimum_squares_to_represent_a_number.py)
+ * [Minimum Steps To One](dynamic_programming/minimum_steps_to_one.py)
+ * [Minimum Tickets Cost](dynamic_programming/minimum_tickets_cost.py)
+ * [Narcissistic Number](dynamic_programming/narcissistic_number.py)
+ * [Optimal Binary Search Tree](dynamic_programming/optimal_binary_search_tree.py)
+ * [Palindrome Partitioning](dynamic_programming/palindrome_partitioning.py)
+ * [Range Sum Query](dynamic_programming/range_sum_query.py)
+ * [Regex Match](dynamic_programming/regex_match.py)
+ * [Rod Cutting](dynamic_programming/rod_cutting.py)
+ * [Smith Waterman](dynamic_programming/smith_waterman.py)
+ * [Subset Generation](dynamic_programming/subset_generation.py)
+ * [Sum Of Subset](dynamic_programming/sum_of_subset.py)
+ * [Trapped Water](dynamic_programming/trapped_water.py)
+ * [Tribonacci](dynamic_programming/tribonacci.py)
+ * [Viterbi](dynamic_programming/viterbi.py)
+ * [Wildcard Matching](dynamic_programming/wildcard_matching.py)
+ * [Word Break](dynamic_programming/word_break.py)
## Electronics
- * [Electric Power](https://github.com/TheAlgorithms/Python/blob/master/electronics/electric_power.py)
- * [Ohms Law](https://github.com/TheAlgorithms/Python/blob/master/electronics/ohms_law.py)
+ * [Apparent Power](electronics/apparent_power.py)
+ * [Builtin Voltage](electronics/builtin_voltage.py)
+ * [Capacitor Equivalence](electronics/capacitor_equivalence.py)
+ * [Carrier Concentration](electronics/carrier_concentration.py)
+ * [Charging Capacitor](electronics/charging_capacitor.py)
+ * [Charging Inductor](electronics/charging_inductor.py)
+ * [Circular Convolution](electronics/circular_convolution.py)
+ * [Coulombs Law](electronics/coulombs_law.py)
+ * [Electric Conductivity](electronics/electric_conductivity.py)
+ * [Electric Power](electronics/electric_power.py)
+ * [Electrical Impedance](electronics/electrical_impedance.py)
+ * [Ic 555 Timer](electronics/ic_555_timer.py)
+ * [Ind Reactance](electronics/ind_reactance.py)
+ * [Ohms Law](electronics/ohms_law.py)
+ * [Real And Reactive Power](electronics/real_and_reactive_power.py)
+ * [Resistor Color Code](electronics/resistor_color_code.py)
+ * [Resistor Equivalence](electronics/resistor_equivalence.py)
+ * [Resonant Frequency](electronics/resonant_frequency.py)
+ * [Wheatstone Bridge](electronics/wheatstone_bridge.py)
## File Transfer
- * [Receive File](https://github.com/TheAlgorithms/Python/blob/master/file_transfer/receive_file.py)
- * [Send File](https://github.com/TheAlgorithms/Python/blob/master/file_transfer/send_file.py)
+ * [Receive File](file_transfer/receive_file.py)
+ * [Send File](file_transfer/send_file.py)
* Tests
- * [Test Send File](https://github.com/TheAlgorithms/Python/blob/master/file_transfer/tests/test_send_file.py)
+ * [Test Send File](file_transfer/tests/test_send_file.py)
+
+## Financial
+ * [Equated Monthly Installments](financial/equated_monthly_installments.py)
+ * [Exponential Moving Average](financial/exponential_moving_average.py)
+ * [Interest](financial/interest.py)
+ * [Present Value](financial/present_value.py)
+ * [Price Plus Tax](financial/price_plus_tax.py)
+ * [Simple Moving Average](financial/simple_moving_average.py)
+ * [Straight Line Depreciation](financial/straight_line_depreciation.py)
+ * [Time And Half Pay](financial/time_and_half_pay.py)
## Fractals
- * [Koch Snowflake](https://github.com/TheAlgorithms/Python/blob/master/fractals/koch_snowflake.py)
- * [Mandelbrot](https://github.com/TheAlgorithms/Python/blob/master/fractals/mandelbrot.py)
- * [Sierpinski Triangle](https://github.com/TheAlgorithms/Python/blob/master/fractals/sierpinski_triangle.py)
+ * [Barnsley Fern](fractals/barnsley_fern.py)
+ * [Julia Sets](fractals/julia_sets.py)
+ * [Koch Snowflake](fractals/koch_snowflake.py)
+ * [Mandelbrot](fractals/mandelbrot.py)
+ * [Sierpinski Carpet](fractals/sierpinski_carpet.py)
+ * [Sierpinski Triangle](fractals/sierpinski_triangle.py)
+ * [Vicsek](fractals/vicsek.py)
## Fuzzy Logic
- * [Fuzzy Operations](https://github.com/TheAlgorithms/Python/blob/master/fuzzy_logic/fuzzy_operations.py)
+ * [Fuzzy Operations](fuzzy_logic/fuzzy_operations.py)
## Genetic Algorithm
- * [Basic String](https://github.com/TheAlgorithms/Python/blob/master/genetic_algorithm/basic_string.py)
+ * [Basic String](genetic_algorithm/basic_string.py)
## Geodesy
- * [Haversine Distance](https://github.com/TheAlgorithms/Python/blob/master/geodesy/haversine_distance.py)
- * [Lamberts Ellipsoidal Distance](https://github.com/TheAlgorithms/Python/blob/master/geodesy/lamberts_ellipsoidal_distance.py)
+ * [Haversine Distance](geodesy/haversine_distance.py)
+ * [Lamberts Ellipsoidal Distance](geodesy/lamberts_ellipsoidal_distance.py)
+
+## Geometry
+ * [Geometry](geometry/geometry.py)
+ * [Graham Scan](geometry/graham_scan.py)
+ * [Jarvis March](geometry/jarvis_march.py)
+ * [Ramer Douglas Peucker](geometry/ramer_douglas_peucker.py)
+ * [Segment Intersection](geometry/segment_intersection.py)
+ * Tests
+ * [Test Graham Scan](geometry/tests/test_graham_scan.py)
+ * [Test Jarvis March](geometry/tests/test_jarvis_march.py)
## Graphics
- * [Bezier Curve](https://github.com/TheAlgorithms/Python/blob/master/graphics/bezier_curve.py)
- * [Vector3 For 2D Rendering](https://github.com/TheAlgorithms/Python/blob/master/graphics/vector3_for_2d_rendering.py)
+ * [Bezier Curve](graphics/bezier_curve.py)
+ * [Butterfly Pattern](graphics/butterfly_pattern.py)
+ * [Digital Differential Analyzer Line](graphics/digital_differential_analyzer_line.py)
+ * [Vector3 For 2D Rendering](graphics/vector3_for_2d_rendering.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)
- * [Bfs Shortest Path](https://github.com/TheAlgorithms/Python/blob/master/graphs/bfs_shortest_path.py)
- * [Bfs Zero One Shortest Path](https://github.com/TheAlgorithms/Python/blob/master/graphs/bfs_zero_one_shortest_path.py)
- * [Bidirectional A Star](https://github.com/TheAlgorithms/Python/blob/master/graphs/bidirectional_a_star.py)
- * [Bidirectional Breadth First Search](https://github.com/TheAlgorithms/Python/blob/master/graphs/bidirectional_breadth_first_search.py)
- * [Breadth First Search](https://github.com/TheAlgorithms/Python/blob/master/graphs/breadth_first_search.py)
- * [Breadth First Search 2](https://github.com/TheAlgorithms/Python/blob/master/graphs/breadth_first_search_2.py)
- * [Breadth First Search Shortest Path](https://github.com/TheAlgorithms/Python/blob/master/graphs/breadth_first_search_shortest_path.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)
- * [Connected Components](https://github.com/TheAlgorithms/Python/blob/master/graphs/connected_components.py)
- * [Depth First Search](https://github.com/TheAlgorithms/Python/blob/master/graphs/depth_first_search.py)
- * [Depth First Search 2](https://github.com/TheAlgorithms/Python/blob/master/graphs/depth_first_search_2.py)
- * [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)
- * [Dinic](https://github.com/TheAlgorithms/Python/blob/master/graphs/dinic.py)
- * [Directed And Undirected (Weighted) Graph](https://github.com/TheAlgorithms/Python/blob/master/graphs/directed_and_undirected_(weighted)_graph.py)
- * [Edmonds Karp Multiple Source And Sink](https://github.com/TheAlgorithms/Python/blob/master/graphs/edmonds_karp_multiple_source_and_sink.py)
- * [Eulerian Path And Circuit For Undirected Graph](https://github.com/TheAlgorithms/Python/blob/master/graphs/eulerian_path_and_circuit_for_undirected_graph.py)
- * [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)
- * [Frequent Pattern Graph Miner](https://github.com/TheAlgorithms/Python/blob/master/graphs/frequent_pattern_graph_miner.py)
- * [G Topological Sort](https://github.com/TheAlgorithms/Python/blob/master/graphs/g_topological_sort.py)
- * [Gale Shapley Bigraph](https://github.com/TheAlgorithms/Python/blob/master/graphs/gale_shapley_bigraph.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)
- * [Graphs Floyd Warshall](https://github.com/TheAlgorithms/Python/blob/master/graphs/graphs_floyd_warshall.py)
- * [Greedy Best First](https://github.com/TheAlgorithms/Python/blob/master/graphs/greedy_best_first.py)
- * [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)
- * [Karger](https://github.com/TheAlgorithms/Python/blob/master/graphs/karger.py)
- * [Markov Chain](https://github.com/TheAlgorithms/Python/blob/master/graphs/markov_chain.py)
- * [Minimum Spanning Tree Boruvka](https://github.com/TheAlgorithms/Python/blob/master/graphs/minimum_spanning_tree_boruvka.py)
- * [Minimum Spanning Tree Kruskal](https://github.com/TheAlgorithms/Python/blob/master/graphs/minimum_spanning_tree_kruskal.py)
- * [Minimum Spanning Tree Kruskal2](https://github.com/TheAlgorithms/Python/blob/master/graphs/minimum_spanning_tree_kruskal2.py)
- * [Minimum Spanning Tree Prims](https://github.com/TheAlgorithms/Python/blob/master/graphs/minimum_spanning_tree_prims.py)
- * [Minimum Spanning Tree Prims2](https://github.com/TheAlgorithms/Python/blob/master/graphs/minimum_spanning_tree_prims2.py)
- * [Multi Heuristic Astar](https://github.com/TheAlgorithms/Python/blob/master/graphs/multi_heuristic_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)
- * [Strongly Connected Components](https://github.com/TheAlgorithms/Python/blob/master/graphs/strongly_connected_components.py)
- * [Tarjans Scc](https://github.com/TheAlgorithms/Python/blob/master/graphs/tarjans_scc.py)
+ * [A Star](graphs/a_star.py)
+ * [Ant Colony Optimization Algorithms](graphs/ant_colony_optimization_algorithms.py)
+ * [Articulation Points](graphs/articulation_points.py)
+ * [Basic Graphs](graphs/basic_graphs.py)
+ * [Bellman Ford](graphs/bellman_ford.py)
+ * [Bi Directional Dijkstra](graphs/bi_directional_dijkstra.py)
+ * [Bidirectional A Star](graphs/bidirectional_a_star.py)
+ * [Bidirectional Breadth First Search](graphs/bidirectional_breadth_first_search.py)
+ * [Bidirectional Search](graphs/bidirectional_search.py)
+ * [Boruvka](graphs/boruvka.py)
+ * [Breadth First Search](graphs/breadth_first_search.py)
+ * [Breadth First Search 2](graphs/breadth_first_search_2.py)
+ * [Breadth First Search Shortest Path](graphs/breadth_first_search_shortest_path.py)
+ * [Breadth First Search Shortest Path 2](graphs/breadth_first_search_shortest_path_2.py)
+ * [Breadth First Search Zero One Shortest Path](graphs/breadth_first_search_zero_one_shortest_path.py)
+ * [Check Bipatrite](graphs/check_bipatrite.py)
+ * [Check Cycle](graphs/check_cycle.py)
+ * [Connected Components](graphs/connected_components.py)
+ * [Deep Clone Graph](graphs/deep_clone_graph.py)
+ * [Depth First Search](graphs/depth_first_search.py)
+ * [Depth First Search 2](graphs/depth_first_search_2.py)
+ * [Dijkstra](graphs/dijkstra.py)
+ * [Dijkstra 2](graphs/dijkstra_2.py)
+ * [Dijkstra Algorithm](graphs/dijkstra_algorithm.py)
+ * [Dijkstra Alternate](graphs/dijkstra_alternate.py)
+ * [Dijkstra Binary Grid](graphs/dijkstra_binary_grid.py)
+ * [Dinic](graphs/dinic.py)
+ * [Directed And Undirected Weighted Graph](graphs/directed_and_undirected_weighted_graph.py)
+ * [Edmonds Karp Multiple Source And Sink](graphs/edmonds_karp_multiple_source_and_sink.py)
+ * [Eulerian Path And Circuit For Undirected Graph](graphs/eulerian_path_and_circuit_for_undirected_graph.py)
+ * [Even Tree](graphs/even_tree.py)
+ * [Finding Bridges](graphs/finding_bridges.py)
+ * [Frequent Pattern Graph Miner](graphs/frequent_pattern_graph_miner.py)
+ * [G Topological Sort](graphs/g_topological_sort.py)
+ * [Gale Shapley Bigraph](graphs/gale_shapley_bigraph.py)
+ * [Graph Adjacency List](graphs/graph_adjacency_list.py)
+ * [Graph Adjacency Matrix](graphs/graph_adjacency_matrix.py)
+ * [Graph List](graphs/graph_list.py)
+ * [Graphs Floyd Warshall](graphs/graphs_floyd_warshall.py)
+ * [Greedy Best First](graphs/greedy_best_first.py)
+ * [Greedy Min Vertex Cover](graphs/greedy_min_vertex_cover.py)
+ * [Johnson](graphs/johnson.py)
+ * [Kahns Algorithm Long](graphs/kahns_algorithm_long.py)
+ * [Kahns Algorithm Topo](graphs/kahns_algorithm_topo.py)
+ * [Karger](graphs/karger.py)
+ * [Lanczos Eigenvectors](graphs/lanczos_eigenvectors.py)
+ * [Markov Chain](graphs/markov_chain.py)
+ * [Matching Min Vertex Cover](graphs/matching_min_vertex_cover.py)
+ * [Minimum Path Sum](graphs/minimum_path_sum.py)
+ * [Minimum Spanning Tree Boruvka](graphs/minimum_spanning_tree_boruvka.py)
+ * [Minimum Spanning Tree Kruskal](graphs/minimum_spanning_tree_kruskal.py)
+ * [Minimum Spanning Tree Kruskal2](graphs/minimum_spanning_tree_kruskal2.py)
+ * [Minimum Spanning Tree Prims](graphs/minimum_spanning_tree_prims.py)
+ * [Minimum Spanning Tree Prims2](graphs/minimum_spanning_tree_prims2.py)
+ * [Multi Heuristic Astar](graphs/multi_heuristic_astar.py)
+ * [Page Rank](graphs/page_rank.py)
+ * [Prim](graphs/prim.py)
+ * [Random Graph Generator](graphs/random_graph_generator.py)
+ * [Scc Kosaraju](graphs/scc_kosaraju.py)
+ * [Strongly Connected Components](graphs/strongly_connected_components.py)
+ * [Tarjans Scc](graphs/tarjans_scc.py)
* Tests
- * [Test Min Spanning Tree Kruskal](https://github.com/TheAlgorithms/Python/blob/master/graphs/tests/test_min_spanning_tree_kruskal.py)
- * [Test Min Spanning Tree Prim](https://github.com/TheAlgorithms/Python/blob/master/graphs/tests/test_min_spanning_tree_prim.py)
+ * [Test Johnson](graphs/tests/test_johnson.py)
+ * [Test Min Spanning Tree Kruskal](graphs/tests/test_min_spanning_tree_kruskal.py)
+ * [Test Min Spanning Tree Prim](graphs/tests/test_min_spanning_tree_prim.py)
+
+## Greedy Methods
+ * [Best Time To Buy And Sell Stock](greedy_methods/best_time_to_buy_and_sell_stock.py)
+ * [Fractional Cover Problem](greedy_methods/fractional_cover_problem.py)
+ * [Fractional Knapsack](greedy_methods/fractional_knapsack.py)
+ * [Fractional Knapsack 2](greedy_methods/fractional_knapsack_2.py)
+ * [Gas Station](greedy_methods/gas_station.py)
+ * [Minimum Coin Change](greedy_methods/minimum_coin_change.py)
+ * [Minimum Waiting Time](greedy_methods/minimum_waiting_time.py)
+ * [Optimal Merge Pattern](greedy_methods/optimal_merge_pattern.py)
+ * [Smallest Range](greedy_methods/smallest_range.py)
## Hashes
- * [Adler32](https://github.com/TheAlgorithms/Python/blob/master/hashes/adler32.py)
- * [Chaos Machine](https://github.com/TheAlgorithms/Python/blob/master/hashes/chaos_machine.py)
- * [Djb2](https://github.com/TheAlgorithms/Python/blob/master/hashes/djb2.py)
- * [Enigma Machine](https://github.com/TheAlgorithms/Python/blob/master/hashes/enigma_machine.py)
- * [Hamming Code](https://github.com/TheAlgorithms/Python/blob/master/hashes/hamming_code.py)
- * [Md5](https://github.com/TheAlgorithms/Python/blob/master/hashes/md5.py)
- * [Sdbm](https://github.com/TheAlgorithms/Python/blob/master/hashes/sdbm.py)
- * [Sha1](https://github.com/TheAlgorithms/Python/blob/master/hashes/sha1.py)
+ * [Adler32](hashes/adler32.py)
+ * [Chaos Machine](hashes/chaos_machine.py)
+ * [Djb2](hashes/djb2.py)
+ * [Elf](hashes/elf.py)
+ * [Enigma Machine](hashes/enigma_machine.py)
+ * [Fletcher16](hashes/fletcher16.py)
+ * [Hamming Code](hashes/hamming_code.py)
+ * [Luhn](hashes/luhn.py)
+ * [Md5](hashes/md5.py)
+ * [Sdbm](hashes/sdbm.py)
+ * [Sha1](hashes/sha1.py)
+ * [Sha256](hashes/sha256.py)
## Knapsack
- * [Greedy Knapsack](https://github.com/TheAlgorithms/Python/blob/master/knapsack/greedy_knapsack.py)
- * [Knapsack](https://github.com/TheAlgorithms/Python/blob/master/knapsack/knapsack.py)
+ * [Greedy Knapsack](knapsack/greedy_knapsack.py)
+ * [Knapsack](knapsack/knapsack.py)
+ * [Recursive Approach Knapsack](knapsack/recursive_approach_knapsack.py)
* Tests
- * [Test Greedy Knapsack](https://github.com/TheAlgorithms/Python/blob/master/knapsack/tests/test_greedy_knapsack.py)
- * [Test Knapsack](https://github.com/TheAlgorithms/Python/blob/master/knapsack/tests/test_knapsack.py)
+ * [Test Greedy Knapsack](knapsack/tests/test_greedy_knapsack.py)
+ * [Test Knapsack](knapsack/tests/test_knapsack.py)
## Linear Algebra
+ * [Gaussian Elimination](linear_algebra/gaussian_elimination.py)
+ * [Jacobi Iteration Method](linear_algebra/jacobi_iteration_method.py)
+ * [Lu Decomposition](linear_algebra/lu_decomposition.py)
+ * [Matrix Inversion](linear_algebra/matrix_inversion.py)
* Src
- * [Conjugate Gradient](https://github.com/TheAlgorithms/Python/blob/master/linear_algebra/src/conjugate_gradient.py)
- * [Lib](https://github.com/TheAlgorithms/Python/blob/master/linear_algebra/src/lib.py)
- * [Polynom For Points](https://github.com/TheAlgorithms/Python/blob/master/linear_algebra/src/polynom_for_points.py)
- * [Power Iteration](https://github.com/TheAlgorithms/Python/blob/master/linear_algebra/src/power_iteration.py)
- * [Rayleigh Quotient](https://github.com/TheAlgorithms/Python/blob/master/linear_algebra/src/rayleigh_quotient.py)
- * [Test Linear Algebra](https://github.com/TheAlgorithms/Python/blob/master/linear_algebra/src/test_linear_algebra.py)
- * [Transformations 2D](https://github.com/TheAlgorithms/Python/blob/master/linear_algebra/src/transformations_2d.py)
+ * [Conjugate Gradient](linear_algebra/src/conjugate_gradient.py)
+ * [Gaussian Elimination Pivoting](linear_algebra/src/gaussian_elimination_pivoting.py)
+ * [Lib](linear_algebra/src/lib.py)
+ * [Polynom For Points](linear_algebra/src/polynom_for_points.py)
+ * [Power Iteration](linear_algebra/src/power_iteration.py)
+ * [Rank Of Matrix](linear_algebra/src/rank_of_matrix.py)
+ * [Rayleigh Quotient](linear_algebra/src/rayleigh_quotient.py)
+ * [Schur Complement](linear_algebra/src/schur_complement.py)
+ * [Test Linear Algebra](linear_algebra/src/test_linear_algebra.py)
+ * [Transformations 2D](linear_algebra/src/transformations_2d.py)
+
+## Linear Programming
+ * [Simplex](linear_programming/simplex.py)
## Machine Learning
- * [Astar](https://github.com/TheAlgorithms/Python/blob/master/machine_learning/astar.py)
- * [Data Transformations](https://github.com/TheAlgorithms/Python/blob/master/machine_learning/data_transformations.py)
- * [Decision Tree](https://github.com/TheAlgorithms/Python/blob/master/machine_learning/decision_tree.py)
+ * [Apriori Algorithm](machine_learning/apriori_algorithm.py)
+ * [Astar](machine_learning/astar.py)
+ * [Automatic Differentiation](machine_learning/automatic_differentiation.py)
+ * [Data Transformations](machine_learning/data_transformations.py)
+ * [Decision Tree](machine_learning/decision_tree.py)
+ * [Dimensionality Reduction](machine_learning/dimensionality_reduction.py)
* Forecasting
- * [Run](https://github.com/TheAlgorithms/Python/blob/master/machine_learning/forecasting/run.py)
- * [Gaussian Naive Bayes](https://github.com/TheAlgorithms/Python/blob/master/machine_learning/gaussian_naive_bayes.py)
- * [Gradient Boosting Regressor](https://github.com/TheAlgorithms/Python/blob/master/machine_learning/gradient_boosting_regressor.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)
- * [K Nearest Neighbours](https://github.com/TheAlgorithms/Python/blob/master/machine_learning/k_nearest_neighbours.py)
- * [Knn Sklearn](https://github.com/TheAlgorithms/Python/blob/master/machine_learning/knn_sklearn.py)
- * [Linear Discriminant Analysis](https://github.com/TheAlgorithms/Python/blob/master/machine_learning/linear_discriminant_analysis.py)
- * [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)
+ * [Run](machine_learning/forecasting/run.py)
+ * [Frequent Pattern Growth](machine_learning/frequent_pattern_growth.py)
+ * [Gradient Boosting Classifier](machine_learning/gradient_boosting_classifier.py)
+ * [Gradient Descent](machine_learning/gradient_descent.py)
+ * [K Means Clust](machine_learning/k_means_clust.py)
+ * [K Nearest Neighbours](machine_learning/k_nearest_neighbours.py)
+ * [Linear Discriminant Analysis](machine_learning/linear_discriminant_analysis.py)
+ * [Linear Regression](machine_learning/linear_regression.py)
+ * Local Weighted Learning
+ * [Local Weighted Learning](machine_learning/local_weighted_learning/local_weighted_learning.py)
+ * [Logistic Regression](machine_learning/logistic_regression.py)
+ * [Loss Functions](machine_learning/loss_functions.py)
* Lstm
- * [Lstm Prediction](https://github.com/TheAlgorithms/Python/blob/master/machine_learning/lstm/lstm_prediction.py)
- * [Multilayer Perceptron Classifier](https://github.com/TheAlgorithms/Python/blob/master/machine_learning/multilayer_perceptron_classifier.py)
- * [Polymonial Regression](https://github.com/TheAlgorithms/Python/blob/master/machine_learning/polymonial_regression.py)
- * [Random Forest Classifier](https://github.com/TheAlgorithms/Python/blob/master/machine_learning/random_forest_classifier.py)
- * [Random Forest Regressor](https://github.com/TheAlgorithms/Python/blob/master/machine_learning/random_forest_regressor.py)
- * [Scoring Functions](https://github.com/TheAlgorithms/Python/blob/master/machine_learning/scoring_functions.py)
- * [Sequential Minimum Optimization](https://github.com/TheAlgorithms/Python/blob/master/machine_learning/sequential_minimum_optimization.py)
- * [Similarity Search](https://github.com/TheAlgorithms/Python/blob/master/machine_learning/similarity_search.py)
- * [Support Vector Machines](https://github.com/TheAlgorithms/Python/blob/master/machine_learning/support_vector_machines.py)
- * [Word Frequency Functions](https://github.com/TheAlgorithms/Python/blob/master/machine_learning/word_frequency_functions.py)
+ * [Lstm Prediction](machine_learning/lstm/lstm_prediction.py)
+ * [Mfcc](machine_learning/mfcc.py)
+ * [Multilayer Perceptron Classifier](machine_learning/multilayer_perceptron_classifier.py)
+ * [Polynomial Regression](machine_learning/polynomial_regression.py)
+ * [Principle Component Analysis](machine_learning/principle_component_analysis.py)
+ * [Scoring Functions](machine_learning/scoring_functions.py)
+ * [Self Organizing Map](machine_learning/self_organizing_map.py)
+ * [Sequential Minimum Optimization](machine_learning/sequential_minimum_optimization.py)
+ * [Similarity Search](machine_learning/similarity_search.py)
+ * [Support Vector Machines](machine_learning/support_vector_machines.py)
+ * [T Stochastic Neighbour Embedding](machine_learning/t_stochastic_neighbour_embedding.py)
+ * [Word Frequency Functions](machine_learning/word_frequency_functions.py)
+ * [Xgboost Classifier](machine_learning/xgboost_classifier.py)
+ * [Xgboost Regressor](machine_learning/xgboost_regressor.py)
## Maths
- * [3N Plus 1](https://github.com/TheAlgorithms/Python/blob/master/maths/3n_plus_1.py)
- * [Abs](https://github.com/TheAlgorithms/Python/blob/master/maths/abs.py)
- * [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)
- * [Add](https://github.com/TheAlgorithms/Python/blob/master/maths/add.py)
- * [Aliquot Sum](https://github.com/TheAlgorithms/Python/blob/master/maths/aliquot_sum.py)
- * [Allocation Number](https://github.com/TheAlgorithms/Python/blob/master/maths/allocation_number.py)
- * [Area](https://github.com/TheAlgorithms/Python/blob/master/maths/area.py)
- * [Area Under Curve](https://github.com/TheAlgorithms/Python/blob/master/maths/area_under_curve.py)
- * [Armstrong Numbers](https://github.com/TheAlgorithms/Python/blob/master/maths/armstrong_numbers.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)
- * [Average Mode](https://github.com/TheAlgorithms/Python/blob/master/maths/average_mode.py)
- * [Bailey Borwein Plouffe](https://github.com/TheAlgorithms/Python/blob/master/maths/bailey_borwein_plouffe.py)
- * [Basic Maths](https://github.com/TheAlgorithms/Python/blob/master/maths/basic_maths.py)
- * [Binary Exp Mod](https://github.com/TheAlgorithms/Python/blob/master/maths/binary_exp_mod.py)
- * [Binary Exponentiation](https://github.com/TheAlgorithms/Python/blob/master/maths/binary_exponentiation.py)
- * [Binary Exponentiation 2](https://github.com/TheAlgorithms/Python/blob/master/maths/binary_exponentiation_2.py)
- * [Binary Exponentiation 3](https://github.com/TheAlgorithms/Python/blob/master/maths/binary_exponentiation_3.py)
- * [Binomial Coefficient](https://github.com/TheAlgorithms/Python/blob/master/maths/binomial_coefficient.py)
- * [Binomial Distribution](https://github.com/TheAlgorithms/Python/blob/master/maths/binomial_distribution.py)
- * [Bisection](https://github.com/TheAlgorithms/Python/blob/master/maths/bisection.py)
- * [Ceil](https://github.com/TheAlgorithms/Python/blob/master/maths/ceil.py)
- * [Chudnovsky Algorithm](https://github.com/TheAlgorithms/Python/blob/master/maths/chudnovsky_algorithm.py)
- * [Collatz Sequence](https://github.com/TheAlgorithms/Python/blob/master/maths/collatz_sequence.py)
- * [Combinations](https://github.com/TheAlgorithms/Python/blob/master/maths/combinations.py)
- * [Decimal Isolate](https://github.com/TheAlgorithms/Python/blob/master/maths/decimal_isolate.py)
- * [Entropy](https://github.com/TheAlgorithms/Python/blob/master/maths/entropy.py)
- * [Euclidean Distance](https://github.com/TheAlgorithms/Python/blob/master/maths/euclidean_distance.py)
- * [Euclidean Gcd](https://github.com/TheAlgorithms/Python/blob/master/maths/euclidean_gcd.py)
- * [Euler Method](https://github.com/TheAlgorithms/Python/blob/master/maths/euler_method.py)
- * [Eulers Totient](https://github.com/TheAlgorithms/Python/blob/master/maths/eulers_totient.py)
- * [Extended Euclidean Algorithm](https://github.com/TheAlgorithms/Python/blob/master/maths/extended_euclidean_algorithm.py)
- * [Factorial Iterative](https://github.com/TheAlgorithms/Python/blob/master/maths/factorial_iterative.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)
- * [Factors](https://github.com/TheAlgorithms/Python/blob/master/maths/factors.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 Max](https://github.com/TheAlgorithms/Python/blob/master/maths/find_max.py)
- * [Find Max Recursion](https://github.com/TheAlgorithms/Python/blob/master/maths/find_max_recursion.py)
- * [Find Min](https://github.com/TheAlgorithms/Python/blob/master/maths/find_min.py)
- * [Find Min Recursion](https://github.com/TheAlgorithms/Python/blob/master/maths/find_min_recursion.py)
- * [Floor](https://github.com/TheAlgorithms/Python/blob/master/maths/floor.py)
- * [Gamma](https://github.com/TheAlgorithms/Python/blob/master/maths/gamma.py)
- * [Gaussian](https://github.com/TheAlgorithms/Python/blob/master/maths/gaussian.py)
- * [Greatest Common Divisor](https://github.com/TheAlgorithms/Python/blob/master/maths/greatest_common_divisor.py)
- * [Greedy Coin Change](https://github.com/TheAlgorithms/Python/blob/master/maths/greedy_coin_change.py)
- * [Hardy Ramanujanalgo](https://github.com/TheAlgorithms/Python/blob/master/maths/hardy_ramanujanalgo.py)
- * [Integration By Simpson Approx](https://github.com/TheAlgorithms/Python/blob/master/maths/integration_by_simpson_approx.py)
- * [Is Square Free](https://github.com/TheAlgorithms/Python/blob/master/maths/is_square_free.py)
- * [Jaccard Similarity](https://github.com/TheAlgorithms/Python/blob/master/maths/jaccard_similarity.py)
- * [Kadanes](https://github.com/TheAlgorithms/Python/blob/master/maths/kadanes.py)
- * [Karatsuba](https://github.com/TheAlgorithms/Python/blob/master/maths/karatsuba.py)
- * [Krishnamurthy Number](https://github.com/TheAlgorithms/Python/blob/master/maths/krishnamurthy_number.py)
- * [Kth Lexicographic Permutation](https://github.com/TheAlgorithms/Python/blob/master/maths/kth_lexicographic_permutation.py)
- * [Largest Of Very Large Numbers](https://github.com/TheAlgorithms/Python/blob/master/maths/largest_of_very_large_numbers.py)
- * [Largest Subarray Sum](https://github.com/TheAlgorithms/Python/blob/master/maths/largest_subarray_sum.py)
- * [Least Common Multiple](https://github.com/TheAlgorithms/Python/blob/master/maths/least_common_multiple.py)
- * [Line Length](https://github.com/TheAlgorithms/Python/blob/master/maths/line_length.py)
- * [Lucas Lehmer Primality Test](https://github.com/TheAlgorithms/Python/blob/master/maths/lucas_lehmer_primality_test.py)
- * [Lucas Series](https://github.com/TheAlgorithms/Python/blob/master/maths/lucas_series.py)
- * [Matrix Exponentiation](https://github.com/TheAlgorithms/Python/blob/master/maths/matrix_exponentiation.py)
- * [Max Sum Sliding Window](https://github.com/TheAlgorithms/Python/blob/master/maths/max_sum_sliding_window.py)
- * [Median Of Two Arrays](https://github.com/TheAlgorithms/Python/blob/master/maths/median_of_two_arrays.py)
- * [Miller Rabin](https://github.com/TheAlgorithms/Python/blob/master/maths/miller_rabin.py)
- * [Mobius Function](https://github.com/TheAlgorithms/Python/blob/master/maths/mobius_function.py)
- * [Modular Exponential](https://github.com/TheAlgorithms/Python/blob/master/maths/modular_exponential.py)
- * [Monte Carlo](https://github.com/TheAlgorithms/Python/blob/master/maths/monte_carlo.py)
- * [Monte Carlo Dice](https://github.com/TheAlgorithms/Python/blob/master/maths/monte_carlo_dice.py)
- * [Newton Raphson](https://github.com/TheAlgorithms/Python/blob/master/maths/newton_raphson.py)
- * [Number Of Digits](https://github.com/TheAlgorithms/Python/blob/master/maths/number_of_digits.py)
- * [Numerical Integration](https://github.com/TheAlgorithms/Python/blob/master/maths/numerical_integration.py)
- * [Perfect Cube](https://github.com/TheAlgorithms/Python/blob/master/maths/perfect_cube.py)
- * [Perfect Number](https://github.com/TheAlgorithms/Python/blob/master/maths/perfect_number.py)
- * [Perfect Square](https://github.com/TheAlgorithms/Python/blob/master/maths/perfect_square.py)
- * [Pi Monte Carlo Estimation](https://github.com/TheAlgorithms/Python/blob/master/maths/pi_monte_carlo_estimation.py)
- * [Polynomial Evaluation](https://github.com/TheAlgorithms/Python/blob/master/maths/polynomial_evaluation.py)
- * [Power Using Recursion](https://github.com/TheAlgorithms/Python/blob/master/maths/power_using_recursion.py)
- * [Prime Check](https://github.com/TheAlgorithms/Python/blob/master/maths/prime_check.py)
- * [Prime Factors](https://github.com/TheAlgorithms/Python/blob/master/maths/prime_factors.py)
- * [Prime Numbers](https://github.com/TheAlgorithms/Python/blob/master/maths/prime_numbers.py)
- * [Prime Sieve Eratosthenes](https://github.com/TheAlgorithms/Python/blob/master/maths/prime_sieve_eratosthenes.py)
- * [Primelib](https://github.com/TheAlgorithms/Python/blob/master/maths/primelib.py)
- * [Pythagoras](https://github.com/TheAlgorithms/Python/blob/master/maths/pythagoras.py)
- * [Qr Decomposition](https://github.com/TheAlgorithms/Python/blob/master/maths/qr_decomposition.py)
- * [Quadratic Equations Complex Numbers](https://github.com/TheAlgorithms/Python/blob/master/maths/quadratic_equations_complex_numbers.py)
- * [Radians](https://github.com/TheAlgorithms/Python/blob/master/maths/radians.py)
- * [Radix2 Fft](https://github.com/TheAlgorithms/Python/blob/master/maths/radix2_fft.py)
- * [Relu](https://github.com/TheAlgorithms/Python/blob/master/maths/relu.py)
- * [Runge Kutta](https://github.com/TheAlgorithms/Python/blob/master/maths/runge_kutta.py)
- * [Segmented Sieve](https://github.com/TheAlgorithms/Python/blob/master/maths/segmented_sieve.py)
+ * [Abs](maths/abs.py)
+ * [Addition Without Arithmetic](maths/addition_without_arithmetic.py)
+ * [Aliquot Sum](maths/aliquot_sum.py)
+ * [Allocation Number](maths/allocation_number.py)
+ * [Arc Length](maths/arc_length.py)
+ * [Area](maths/area.py)
+ * [Area Under Curve](maths/area_under_curve.py)
+ * [Average Absolute Deviation](maths/average_absolute_deviation.py)
+ * [Average Mean](maths/average_mean.py)
+ * [Average Median](maths/average_median.py)
+ * [Average Mode](maths/average_mode.py)
+ * [Bailey Borwein Plouffe](maths/bailey_borwein_plouffe.py)
+ * [Base Neg2 Conversion](maths/base_neg2_conversion.py)
+ * [Basic Maths](maths/basic_maths.py)
+ * [Binary Exponentiation](maths/binary_exponentiation.py)
+ * [Binary Multiplication](maths/binary_multiplication.py)
+ * [Binomial Coefficient](maths/binomial_coefficient.py)
+ * [Binomial Distribution](maths/binomial_distribution.py)
+ * [Ceil](maths/ceil.py)
+ * [Chebyshev Distance](maths/chebyshev_distance.py)
+ * [Check Polygon](maths/check_polygon.py)
+ * [Chinese Remainder Theorem](maths/chinese_remainder_theorem.py)
+ * [Chudnovsky Algorithm](maths/chudnovsky_algorithm.py)
+ * [Collatz Sequence](maths/collatz_sequence.py)
+ * [Combinations](maths/combinations.py)
+ * [Continued Fraction](maths/continued_fraction.py)
+ * [Decimal Isolate](maths/decimal_isolate.py)
+ * [Decimal To Fraction](maths/decimal_to_fraction.py)
+ * [Dodecahedron](maths/dodecahedron.py)
+ * [Double Factorial](maths/double_factorial.py)
+ * [Dual Number Automatic Differentiation](maths/dual_number_automatic_differentiation.py)
+ * [Entropy](maths/entropy.py)
+ * [Euclidean Distance](maths/euclidean_distance.py)
+ * [Euler Method](maths/euler_method.py)
+ * [Euler Modified](maths/euler_modified.py)
+ * [Eulers Totient](maths/eulers_totient.py)
+ * [Extended Euclidean Algorithm](maths/extended_euclidean_algorithm.py)
+ * [Factorial](maths/factorial.py)
+ * [Factors](maths/factors.py)
+ * [Fast Inverse Sqrt](maths/fast_inverse_sqrt.py)
+ * [Fermat Little Theorem](maths/fermat_little_theorem.py)
+ * [Fibonacci](maths/fibonacci.py)
+ * [Find Max](maths/find_max.py)
+ * [Find Min](maths/find_min.py)
+ * [Floor](maths/floor.py)
+ * [Gamma](maths/gamma.py)
+ * [Gaussian](maths/gaussian.py)
+ * [Gcd Of N Numbers](maths/gcd_of_n_numbers.py)
+ * [Geometric Mean](maths/geometric_mean.py)
+ * [Germain Primes](maths/germain_primes.py)
+ * [Greatest Common Divisor](maths/greatest_common_divisor.py)
+ * [Hardy Ramanujanalgo](maths/hardy_ramanujanalgo.py)
+ * [Integer Square Root](maths/integer_square_root.py)
+ * [Interquartile Range](maths/interquartile_range.py)
+ * [Is Int Palindrome](maths/is_int_palindrome.py)
+ * [Is Ip V4 Address Valid](maths/is_ip_v4_address_valid.py)
+ * [Is Square Free](maths/is_square_free.py)
+ * [Jaccard Similarity](maths/jaccard_similarity.py)
+ * [Joint Probability Distribution](maths/joint_probability_distribution.py)
+ * [Josephus Problem](maths/josephus_problem.py)
+ * [Juggler Sequence](maths/juggler_sequence.py)
+ * [Karatsuba](maths/karatsuba.py)
+ * [Kth Lexicographic Permutation](maths/kth_lexicographic_permutation.py)
+ * [Largest Of Very Large Numbers](maths/largest_of_very_large_numbers.py)
+ * [Least Common Multiple](maths/least_common_multiple.py)
+ * [Line Length](maths/line_length.py)
+ * [Liouville Lambda](maths/liouville_lambda.py)
+ * [Lucas Lehmer Primality Test](maths/lucas_lehmer_primality_test.py)
+ * [Lucas Series](maths/lucas_series.py)
+ * [Maclaurin Series](maths/maclaurin_series.py)
+ * [Manhattan Distance](maths/manhattan_distance.py)
+ * [Matrix Exponentiation](maths/matrix_exponentiation.py)
+ * [Max Sum Sliding Window](maths/max_sum_sliding_window.py)
+ * [Minkowski Distance](maths/minkowski_distance.py)
+ * [Mobius Function](maths/mobius_function.py)
+ * [Modular Division](maths/modular_division.py)
+ * [Modular Exponential](maths/modular_exponential.py)
+ * [Monte Carlo](maths/monte_carlo.py)
+ * [Monte Carlo Dice](maths/monte_carlo_dice.py)
+ * [Number Of Digits](maths/number_of_digits.py)
+ * Numerical Analysis
+ * [Adams Bashforth](maths/numerical_analysis/adams_bashforth.py)
+ * [Bisection](maths/numerical_analysis/bisection.py)
+ * [Bisection 2](maths/numerical_analysis/bisection_2.py)
+ * [Integration By Simpson Approx](maths/numerical_analysis/integration_by_simpson_approx.py)
+ * [Intersection](maths/numerical_analysis/intersection.py)
+ * [Nevilles Method](maths/numerical_analysis/nevilles_method.py)
+ * [Newton Forward Interpolation](maths/numerical_analysis/newton_forward_interpolation.py)
+ * [Newton Raphson](maths/numerical_analysis/newton_raphson.py)
+ * [Numerical Integration](maths/numerical_analysis/numerical_integration.py)
+ * [Proper Fractions](maths/numerical_analysis/proper_fractions.py)
+ * [Runge Kutta](maths/numerical_analysis/runge_kutta.py)
+ * [Runge Kutta Fehlberg 45](maths/numerical_analysis/runge_kutta_fehlberg_45.py)
+ * [Runge Kutta Gills](maths/numerical_analysis/runge_kutta_gills.py)
+ * [Secant Method](maths/numerical_analysis/secant_method.py)
+ * [Simpson Rule](maths/numerical_analysis/simpson_rule.py)
+ * [Square Root](maths/numerical_analysis/square_root.py)
+ * [Weierstrass Method](maths/numerical_analysis/weierstrass_method.py)
+ * [Odd Sieve](maths/odd_sieve.py)
+ * [Perfect Cube](maths/perfect_cube.py)
+ * [Perfect Number](maths/perfect_number.py)
+ * [Perfect Square](maths/perfect_square.py)
+ * [Persistence](maths/persistence.py)
+ * [Pi Generator](maths/pi_generator.py)
+ * [Pi Monte Carlo Estimation](maths/pi_monte_carlo_estimation.py)
+ * [Points Are Collinear 3D](maths/points_are_collinear_3d.py)
+ * [Pollard Rho](maths/pollard_rho.py)
+ * [Polynomial Evaluation](maths/polynomial_evaluation.py)
+ * Polynomials
+ * [Single Indeterminate Operations](maths/polynomials/single_indeterminate_operations.py)
+ * [Power Using Recursion](maths/power_using_recursion.py)
+ * [Prime Check](maths/prime_check.py)
+ * [Prime Factors](maths/prime_factors.py)
+ * [Prime Numbers](maths/prime_numbers.py)
+ * [Prime Sieve Eratosthenes](maths/prime_sieve_eratosthenes.py)
+ * [Primelib](maths/primelib.py)
+ * [Print Multiplication Table](maths/print_multiplication_table.py)
+ * [Pythagoras](maths/pythagoras.py)
+ * [Qr Decomposition](maths/qr_decomposition.py)
+ * [Quadratic Equations Complex Numbers](maths/quadratic_equations_complex_numbers.py)
+ * [Radians](maths/radians.py)
+ * [Radix2 Fft](maths/radix2_fft.py)
+ * [Remove Digit](maths/remove_digit.py)
+ * [Segmented Sieve](maths/segmented_sieve.py)
* Series
- * [Arithmetic Mean](https://github.com/TheAlgorithms/Python/blob/master/maths/series/arithmetic_mean.py)
- * [Geometric Mean](https://github.com/TheAlgorithms/Python/blob/master/maths/series/geometric_mean.py)
- * [Geometric Series](https://github.com/TheAlgorithms/Python/blob/master/maths/series/geometric_series.py)
- * [Harmonic Series](https://github.com/TheAlgorithms/Python/blob/master/maths/series/harmonic_series.py)
- * [P Series](https://github.com/TheAlgorithms/Python/blob/master/maths/series/p_series.py)
- * [Sieve Of Eratosthenes](https://github.com/TheAlgorithms/Python/blob/master/maths/sieve_of_eratosthenes.py)
- * [Sigmoid](https://github.com/TheAlgorithms/Python/blob/master/maths/sigmoid.py)
- * [Simpson Rule](https://github.com/TheAlgorithms/Python/blob/master/maths/simpson_rule.py)
- * [Softmax](https://github.com/TheAlgorithms/Python/blob/master/maths/softmax.py)
- * [Square Root](https://github.com/TheAlgorithms/Python/blob/master/maths/square_root.py)
- * [Sum Of Arithmetic Series](https://github.com/TheAlgorithms/Python/blob/master/maths/sum_of_arithmetic_series.py)
- * [Sum Of Digits](https://github.com/TheAlgorithms/Python/blob/master/maths/sum_of_digits.py)
- * [Sum Of Geometric Progression](https://github.com/TheAlgorithms/Python/blob/master/maths/sum_of_geometric_progression.py)
- * [Test Prime Check](https://github.com/TheAlgorithms/Python/blob/master/maths/test_prime_check.py)
- * [Trapezoidal Rule](https://github.com/TheAlgorithms/Python/blob/master/maths/trapezoidal_rule.py)
- * [Triplet Sum](https://github.com/TheAlgorithms/Python/blob/master/maths/triplet_sum.py)
- * [Two Pointer](https://github.com/TheAlgorithms/Python/blob/master/maths/two_pointer.py)
- * [Two Sum](https://github.com/TheAlgorithms/Python/blob/master/maths/two_sum.py)
- * [Ugly Numbers](https://github.com/TheAlgorithms/Python/blob/master/maths/ugly_numbers.py)
- * [Volume](https://github.com/TheAlgorithms/Python/blob/master/maths/volume.py)
- * [Zellers Congruence](https://github.com/TheAlgorithms/Python/blob/master/maths/zellers_congruence.py)
+ * [Arithmetic](maths/series/arithmetic.py)
+ * [Geometric](maths/series/geometric.py)
+ * [Geometric Series](maths/series/geometric_series.py)
+ * [Harmonic](maths/series/harmonic.py)
+ * [Harmonic Series](maths/series/harmonic_series.py)
+ * [Hexagonal Numbers](maths/series/hexagonal_numbers.py)
+ * [P Series](maths/series/p_series.py)
+ * [Sieve Of Eratosthenes](maths/sieve_of_eratosthenes.py)
+ * [Sigmoid](maths/sigmoid.py)
+ * [Signum](maths/signum.py)
+ * [Simultaneous Linear Equation Solver](maths/simultaneous_linear_equation_solver.py)
+ * [Sin](maths/sin.py)
+ * [Sock Merchant](maths/sock_merchant.py)
+ * [Softmax](maths/softmax.py)
+ * [Solovay Strassen Primality Test](maths/solovay_strassen_primality_test.py)
+ * [Spearman Rank Correlation Coefficient](maths/spearman_rank_correlation_coefficient.py)
+ * Special Numbers
+ * [Armstrong Numbers](maths/special_numbers/armstrong_numbers.py)
+ * [Automorphic Number](maths/special_numbers/automorphic_number.py)
+ * [Bell Numbers](maths/special_numbers/bell_numbers.py)
+ * [Carmichael Number](maths/special_numbers/carmichael_number.py)
+ * [Catalan Number](maths/special_numbers/catalan_number.py)
+ * [Hamming Numbers](maths/special_numbers/hamming_numbers.py)
+ * [Happy Number](maths/special_numbers/happy_number.py)
+ * [Harshad Numbers](maths/special_numbers/harshad_numbers.py)
+ * [Hexagonal Number](maths/special_numbers/hexagonal_number.py)
+ * [Krishnamurthy Number](maths/special_numbers/krishnamurthy_number.py)
+ * [Perfect Number](maths/special_numbers/perfect_number.py)
+ * [Polygonal Numbers](maths/special_numbers/polygonal_numbers.py)
+ * [Pronic Number](maths/special_numbers/pronic_number.py)
+ * [Proth Number](maths/special_numbers/proth_number.py)
+ * [Triangular Numbers](maths/special_numbers/triangular_numbers.py)
+ * [Ugly Numbers](maths/special_numbers/ugly_numbers.py)
+ * [Weird Number](maths/special_numbers/weird_number.py)
+ * [Sum Of Arithmetic Series](maths/sum_of_arithmetic_series.py)
+ * [Sum Of Digits](maths/sum_of_digits.py)
+ * [Sum Of Geometric Progression](maths/sum_of_geometric_progression.py)
+ * [Sum Of Harmonic Series](maths/sum_of_harmonic_series.py)
+ * [Sumset](maths/sumset.py)
+ * [Sylvester Sequence](maths/sylvester_sequence.py)
+ * [Tanh](maths/tanh.py)
+ * [Test Factorial](maths/test_factorial.py)
+ * [Test Prime Check](maths/test_prime_check.py)
+ * [Three Sum](maths/three_sum.py)
+ * [Trapezoidal Rule](maths/trapezoidal_rule.py)
+ * [Triplet Sum](maths/triplet_sum.py)
+ * [Twin Prime](maths/twin_prime.py)
+ * [Two Pointer](maths/two_pointer.py)
+ * [Two Sum](maths/two_sum.py)
+ * [Volume](maths/volume.py)
+ * [Zellers Congruence](maths/zellers_congruence.py)
## Matrix
- * [Count Islands In Matrix](https://github.com/TheAlgorithms/Python/blob/master/matrix/count_islands_in_matrix.py)
- * [Inverse Of Matrix](https://github.com/TheAlgorithms/Python/blob/master/matrix/inverse_of_matrix.py)
- * [Matrix Class](https://github.com/TheAlgorithms/Python/blob/master/matrix/matrix_class.py)
- * [Matrix Operation](https://github.com/TheAlgorithms/Python/blob/master/matrix/matrix_operation.py)
- * [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)
- * [Searching In Sorted Matrix](https://github.com/TheAlgorithms/Python/blob/master/matrix/searching_in_sorted_matrix.py)
- * [Sherman Morrison](https://github.com/TheAlgorithms/Python/blob/master/matrix/sherman_morrison.py)
- * [Spiral Print](https://github.com/TheAlgorithms/Python/blob/master/matrix/spiral_print.py)
+ * [Binary Search Matrix](matrix/binary_search_matrix.py)
+ * [Count Islands In Matrix](matrix/count_islands_in_matrix.py)
+ * [Count Negative Numbers In Sorted Matrix](matrix/count_negative_numbers_in_sorted_matrix.py)
+ * [Count Paths](matrix/count_paths.py)
+ * [Cramers Rule 2X2](matrix/cramers_rule_2x2.py)
+ * [Inverse Of Matrix](matrix/inverse_of_matrix.py)
+ * [Largest Square Area In Matrix](matrix/largest_square_area_in_matrix.py)
+ * [Matrix Based Game](matrix/matrix_based_game.py)
+ * [Matrix Class](matrix/matrix_class.py)
+ * [Matrix Equalization](matrix/matrix_equalization.py)
+ * [Matrix Multiplication Recursion](matrix/matrix_multiplication_recursion.py)
+ * [Matrix Operation](matrix/matrix_operation.py)
+ * [Max Area Of Island](matrix/max_area_of_island.py)
+ * [Median Matrix](matrix/median_matrix.py)
+ * [Nth Fibonacci Using Matrix Exponentiation](matrix/nth_fibonacci_using_matrix_exponentiation.py)
+ * [Pascal Triangle](matrix/pascal_triangle.py)
+ * [Rotate Matrix](matrix/rotate_matrix.py)
+ * [Searching In Sorted Matrix](matrix/searching_in_sorted_matrix.py)
+ * [Sherman Morrison](matrix/sherman_morrison.py)
+ * [Spiral Print](matrix/spiral_print.py)
* Tests
- * [Test Matrix Operation](https://github.com/TheAlgorithms/Python/blob/master/matrix/tests/test_matrix_operation.py)
+ * [Test Matrix Operation](matrix/tests/test_matrix_operation.py)
+ * [Validate Sudoku Board](matrix/validate_sudoku_board.py)
## 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)
+ * [Dinic](networking_flow/dinic.py)
+ * [Ford Fulkerson](networking_flow/ford_fulkerson.py)
+ * [Minimum Cut](networking_flow/minimum_cut.py)
+ * [Push Relabel](networking_flow/push_relabel.py)
## Neural Network
- * [2 Hidden Layers Neural Network](https://github.com/TheAlgorithms/Python/blob/master/neural_network/2_hidden_layers_neural_network.py)
- * [Back Propagation Neural Network](https://github.com/TheAlgorithms/Python/blob/master/neural_network/back_propagation_neural_network.py)
- * [Convolution Neural Network](https://github.com/TheAlgorithms/Python/blob/master/neural_network/convolution_neural_network.py)
- * [Perceptron](https://github.com/TheAlgorithms/Python/blob/master/neural_network/perceptron.py)
+ * Activation Functions
+ * [Binary Step](neural_network/activation_functions/binary_step.py)
+ * [Exponential Linear Unit](neural_network/activation_functions/exponential_linear_unit.py)
+ * [Gaussian Error Linear Unit](neural_network/activation_functions/gaussian_error_linear_unit.py)
+ * [Leaky Rectified Linear Unit](neural_network/activation_functions/leaky_rectified_linear_unit.py)
+ * [Mish](neural_network/activation_functions/mish.py)
+ * [Rectified Linear Unit](neural_network/activation_functions/rectified_linear_unit.py)
+ * [Scaled Exponential Linear Unit](neural_network/activation_functions/scaled_exponential_linear_unit.py)
+ * [Soboleva Modified Hyperbolic Tangent](neural_network/activation_functions/soboleva_modified_hyperbolic_tangent.py)
+ * [Softplus](neural_network/activation_functions/softplus.py)
+ * [Squareplus](neural_network/activation_functions/squareplus.py)
+ * [Swish](neural_network/activation_functions/swish.py)
+ * [Back Propagation Neural Network](neural_network/back_propagation_neural_network.py)
+ * [Convolution Neural Network](neural_network/convolution_neural_network.py)
+ * [Input Data](neural_network/input_data.py)
+ * [Simple Neural Network](neural_network/simple_neural_network.py)
+ * [Two Hidden Layers Neural Network](neural_network/two_hidden_layers_neural_network.py)
## Other
- * [Activity Selection](https://github.com/TheAlgorithms/Python/blob/master/other/activity_selection.py)
- * [Davis–Putnam–Logemann–Loveland](https://github.com/TheAlgorithms/Python/blob/master/other/davis–putnam–logemann–loveland.py)
- * [Dijkstra Bankers Algorithm](https://github.com/TheAlgorithms/Python/blob/master/other/dijkstra_bankers_algorithm.py)
- * [Doomsday](https://github.com/TheAlgorithms/Python/blob/master/other/doomsday.py)
- * [Fischer Yates Shuffle](https://github.com/TheAlgorithms/Python/blob/master/other/fischer_yates_shuffle.py)
- * [Gauss Easter](https://github.com/TheAlgorithms/Python/blob/master/other/gauss_easter.py)
- * [Graham Scan](https://github.com/TheAlgorithms/Python/blob/master/other/graham_scan.py)
- * [Greedy](https://github.com/TheAlgorithms/Python/blob/master/other/greedy.py)
- * [Least Recently Used](https://github.com/TheAlgorithms/Python/blob/master/other/least_recently_used.py)
- * [Lfu Cache](https://github.com/TheAlgorithms/Python/blob/master/other/lfu_cache.py)
- * [Linear Congruential Generator](https://github.com/TheAlgorithms/Python/blob/master/other/linear_congruential_generator.py)
- * [Lru Cache](https://github.com/TheAlgorithms/Python/blob/master/other/lru_cache.py)
- * [Magicdiamondpattern](https://github.com/TheAlgorithms/Python/blob/master/other/magicdiamondpattern.py)
- * [Nested Brackets](https://github.com/TheAlgorithms/Python/blob/master/other/nested_brackets.py)
- * [Password Generator](https://github.com/TheAlgorithms/Python/blob/master/other/password_generator.py)
- * [Scoring Algorithm](https://github.com/TheAlgorithms/Python/blob/master/other/scoring_algorithm.py)
- * [Sdes](https://github.com/TheAlgorithms/Python/blob/master/other/sdes.py)
- * [Tower Of Hanoi](https://github.com/TheAlgorithms/Python/blob/master/other/tower_of_hanoi.py)
+ * [Activity Selection](other/activity_selection.py)
+ * [Alternative List Arrange](other/alternative_list_arrange.py)
+ * [Bankers Algorithm](other/bankers_algorithm.py)
+ * [Davis Putnam Logemann Loveland](other/davis_putnam_logemann_loveland.py)
+ * [Doomsday](other/doomsday.py)
+ * [Fischer Yates Shuffle](other/fischer_yates_shuffle.py)
+ * [Gauss Easter](other/gauss_easter.py)
+ * [Graham Scan](other/graham_scan.py)
+ * [Greedy](other/greedy.py)
+ * [Guess The Number Search](other/guess_the_number_search.py)
+ * [H Index](other/h_index.py)
+ * [Least Recently Used](other/least_recently_used.py)
+ * [Lfu Cache](other/lfu_cache.py)
+ * [Linear Congruential Generator](other/linear_congruential_generator.py)
+ * [Lru Cache](other/lru_cache.py)
+ * [Magicdiamondpattern](other/magicdiamondpattern.py)
+ * [Majority Vote Algorithm](other/majority_vote_algorithm.py)
+ * [Maximum Subsequence](other/maximum_subsequence.py)
+ * [Nested Brackets](other/nested_brackets.py)
+ * [Number Container System](other/number_container_system.py)
+ * [Password](other/password.py)
+ * [Quine](other/quine.py)
+ * [Scoring Algorithm](other/scoring_algorithm.py)
+ * [Sdes](other/sdes.py)
+ * [Sliding Window Maximum](other/sliding_window_maximum.py)
+ * [Tower Of Hanoi](other/tower_of_hanoi.py)
+ * [Word Search](other/word_search.py)
## Physics
- * [N Body Simulation](https://github.com/TheAlgorithms/Python/blob/master/physics/n_body_simulation.py)
+ * [Altitude Pressure](physics/altitude_pressure.py)
+ * [Archimedes Principle Of Buoyant Force](physics/archimedes_principle_of_buoyant_force.py)
+ * [Basic Orbital Capture](physics/basic_orbital_capture.py)
+ * [Casimir Effect](physics/casimir_effect.py)
+ * [Center Of Mass](physics/center_of_mass.py)
+ * [Centripetal Force](physics/centripetal_force.py)
+ * [Coulombs Law](physics/coulombs_law.py)
+ * [Doppler Frequency](physics/doppler_frequency.py)
+ * [Escape Velocity](physics/escape_velocity.py)
+ * [Grahams Law](physics/grahams_law.py)
+ * [Horizontal Projectile Motion](physics/horizontal_projectile_motion.py)
+ * [Hubble Parameter](physics/hubble_parameter.py)
+ * [Ideal Gas Law](physics/ideal_gas_law.py)
+ * [In Static Equilibrium](physics/in_static_equilibrium.py)
+ * [Kinetic Energy](physics/kinetic_energy.py)
+ * [Lens Formulae](physics/lens_formulae.py)
+ * [Lorentz Transformation Four Vector](physics/lorentz_transformation_four_vector.py)
+ * [Malus Law](physics/malus_law.py)
+ * [Mass Energy Equivalence](physics/mass_energy_equivalence.py)
+ * [Mirror Formulae](physics/mirror_formulae.py)
+ * [N Body Simulation](physics/n_body_simulation.py)
+ * [Newtons Law Of Gravitation](physics/newtons_law_of_gravitation.py)
+ * [Newtons Second Law Of Motion](physics/newtons_second_law_of_motion.py)
+ * [Orbital Transfer Work](physics/orbital_transfer_work.py)
+ * [Period Of Pendulum](physics/period_of_pendulum.py)
+ * [Photoelectric Effect](physics/photoelectric_effect.py)
+ * [Potential Energy](physics/potential_energy.py)
+ * [Rainfall Intensity](physics/rainfall_intensity.py)
+ * [Reynolds Number](physics/reynolds_number.py)
+ * [Rms Speed Of Molecule](physics/rms_speed_of_molecule.py)
+ * [Shear Stress](physics/shear_stress.py)
+ * [Speed Of Sound](physics/speed_of_sound.py)
+ * [Speeds Of Gas Molecules](physics/speeds_of_gas_molecules.py)
+ * [Terminal Velocity](physics/terminal_velocity.py)
## Project Euler
* Problem 001
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_001/sol1.py)
- * [Sol2](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_001/sol2.py)
- * [Sol3](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_001/sol3.py)
- * [Sol4](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_001/sol4.py)
- * [Sol5](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_001/sol5.py)
- * [Sol6](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_001/sol6.py)
- * [Sol7](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_001/sol7.py)
+ * [Sol1](project_euler/problem_001/sol1.py)
+ * [Sol2](project_euler/problem_001/sol2.py)
+ * [Sol3](project_euler/problem_001/sol3.py)
+ * [Sol4](project_euler/problem_001/sol4.py)
+ * [Sol5](project_euler/problem_001/sol5.py)
+ * [Sol6](project_euler/problem_001/sol6.py)
+ * [Sol7](project_euler/problem_001/sol7.py)
* Problem 002
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_002/sol1.py)
- * [Sol2](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_002/sol2.py)
- * [Sol3](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_002/sol3.py)
- * [Sol4](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_002/sol4.py)
- * [Sol5](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_002/sol5.py)
+ * [Sol1](project_euler/problem_002/sol1.py)
+ * [Sol2](project_euler/problem_002/sol2.py)
+ * [Sol3](project_euler/problem_002/sol3.py)
+ * [Sol4](project_euler/problem_002/sol4.py)
+ * [Sol5](project_euler/problem_002/sol5.py)
* Problem 003
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_003/sol1.py)
- * [Sol2](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_003/sol2.py)
- * [Sol3](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_003/sol3.py)
+ * [Sol1](project_euler/problem_003/sol1.py)
+ * [Sol2](project_euler/problem_003/sol2.py)
+ * [Sol3](project_euler/problem_003/sol3.py)
* Problem 004
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_004/sol1.py)
- * [Sol2](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_004/sol2.py)
+ * [Sol1](project_euler/problem_004/sol1.py)
+ * [Sol2](project_euler/problem_004/sol2.py)
* Problem 005
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_005/sol1.py)
- * [Sol2](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_005/sol2.py)
+ * [Sol1](project_euler/problem_005/sol1.py)
+ * [Sol2](project_euler/problem_005/sol2.py)
* Problem 006
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_006/sol1.py)
- * [Sol2](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_006/sol2.py)
- * [Sol3](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_006/sol3.py)
- * [Sol4](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_006/sol4.py)
+ * [Sol1](project_euler/problem_006/sol1.py)
+ * [Sol2](project_euler/problem_006/sol2.py)
+ * [Sol3](project_euler/problem_006/sol3.py)
+ * [Sol4](project_euler/problem_006/sol4.py)
* Problem 007
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_007/sol1.py)
- * [Sol2](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_007/sol2.py)
- * [Sol3](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_007/sol3.py)
+ * [Sol1](project_euler/problem_007/sol1.py)
+ * [Sol2](project_euler/problem_007/sol2.py)
+ * [Sol3](project_euler/problem_007/sol3.py)
* Problem 008
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_008/sol1.py)
- * [Sol2](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_008/sol2.py)
- * [Sol3](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_008/sol3.py)
+ * [Sol1](project_euler/problem_008/sol1.py)
+ * [Sol2](project_euler/problem_008/sol2.py)
+ * [Sol3](project_euler/problem_008/sol3.py)
* Problem 009
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_009/sol1.py)
- * [Sol2](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_009/sol2.py)
- * [Sol3](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_009/sol3.py)
+ * [Sol1](project_euler/problem_009/sol1.py)
+ * [Sol2](project_euler/problem_009/sol2.py)
+ * [Sol3](project_euler/problem_009/sol3.py)
+ * [Sol4](project_euler/problem_009/sol4.py)
* Problem 010
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_010/sol1.py)
- * [Sol2](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_010/sol2.py)
- * [Sol3](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_010/sol3.py)
+ * [Sol1](project_euler/problem_010/sol1.py)
+ * [Sol2](project_euler/problem_010/sol2.py)
+ * [Sol3](project_euler/problem_010/sol3.py)
* Problem 011
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_011/sol1.py)
- * [Sol2](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_011/sol2.py)
+ * [Sol1](project_euler/problem_011/sol1.py)
+ * [Sol2](project_euler/problem_011/sol2.py)
* Problem 012
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_012/sol1.py)
- * [Sol2](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_012/sol2.py)
+ * [Sol1](project_euler/problem_012/sol1.py)
+ * [Sol2](project_euler/problem_012/sol2.py)
* Problem 013
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_013/sol1.py)
+ * [Sol1](project_euler/problem_013/sol1.py)
* Problem 014
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_014/sol1.py)
- * [Sol2](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_014/sol2.py)
+ * [Sol1](project_euler/problem_014/sol1.py)
+ * [Sol2](project_euler/problem_014/sol2.py)
* Problem 015
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_015/sol1.py)
+ * [Sol1](project_euler/problem_015/sol1.py)
+ * [Sol2](project_euler/problem_015/sol2.py)
* Problem 016
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_016/sol1.py)
- * [Sol2](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_016/sol2.py)
+ * [Sol1](project_euler/problem_016/sol1.py)
+ * [Sol2](project_euler/problem_016/sol2.py)
* Problem 017
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_017/sol1.py)
+ * [Sol1](project_euler/problem_017/sol1.py)
* Problem 018
- * [Solution](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_018/solution.py)
+ * [Solution](project_euler/problem_018/solution.py)
* Problem 019
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_019/sol1.py)
+ * [Sol1](project_euler/problem_019/sol1.py)
* Problem 020
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_020/sol1.py)
- * [Sol2](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_020/sol2.py)
- * [Sol3](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_020/sol3.py)
- * [Sol4](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_020/sol4.py)
+ * [Sol1](project_euler/problem_020/sol1.py)
+ * [Sol2](project_euler/problem_020/sol2.py)
+ * [Sol3](project_euler/problem_020/sol3.py)
+ * [Sol4](project_euler/problem_020/sol4.py)
* Problem 021
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_021/sol1.py)
+ * [Sol1](project_euler/problem_021/sol1.py)
* Problem 022
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_022/sol1.py)
- * [Sol2](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_022/sol2.py)
+ * [Sol1](project_euler/problem_022/sol1.py)
+ * [Sol2](project_euler/problem_022/sol2.py)
* Problem 023
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_023/sol1.py)
+ * [Sol1](project_euler/problem_023/sol1.py)
* Problem 024
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_024/sol1.py)
+ * [Sol1](project_euler/problem_024/sol1.py)
* Problem 025
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_025/sol1.py)
- * [Sol2](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_025/sol2.py)
- * [Sol3](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_025/sol3.py)
+ * [Sol1](project_euler/problem_025/sol1.py)
+ * [Sol2](project_euler/problem_025/sol2.py)
+ * [Sol3](project_euler/problem_025/sol3.py)
* Problem 026
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_026/sol1.py)
+ * [Sol1](project_euler/problem_026/sol1.py)
* Problem 027
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_027/sol1.py)
+ * [Sol1](project_euler/problem_027/sol1.py)
* Problem 028
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_028/sol1.py)
+ * [Sol1](project_euler/problem_028/sol1.py)
* Problem 029
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_029/sol1.py)
+ * [Sol1](project_euler/problem_029/sol1.py)
* Problem 030
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_030/sol1.py)
+ * [Sol1](project_euler/problem_030/sol1.py)
* Problem 031
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_031/sol1.py)
- * [Sol2](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_031/sol2.py)
+ * [Sol1](project_euler/problem_031/sol1.py)
+ * [Sol2](project_euler/problem_031/sol2.py)
* Problem 032
- * [Sol32](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_032/sol32.py)
+ * [Sol32](project_euler/problem_032/sol32.py)
* Problem 033
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_033/sol1.py)
+ * [Sol1](project_euler/problem_033/sol1.py)
* Problem 034
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_034/sol1.py)
+ * [Sol1](project_euler/problem_034/sol1.py)
* Problem 035
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_035/sol1.py)
+ * [Sol1](project_euler/problem_035/sol1.py)
* Problem 036
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_036/sol1.py)
+ * [Sol1](project_euler/problem_036/sol1.py)
* Problem 037
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_037/sol1.py)
+ * [Sol1](project_euler/problem_037/sol1.py)
* Problem 038
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_038/sol1.py)
+ * [Sol1](project_euler/problem_038/sol1.py)
* Problem 039
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_039/sol1.py)
+ * [Sol1](project_euler/problem_039/sol1.py)
* Problem 040
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_040/sol1.py)
+ * [Sol1](project_euler/problem_040/sol1.py)
* Problem 041
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_041/sol1.py)
+ * [Sol1](project_euler/problem_041/sol1.py)
* Problem 042
- * [Solution42](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_042/solution42.py)
+ * [Solution42](project_euler/problem_042/solution42.py)
* Problem 043
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_043/sol1.py)
+ * [Sol1](project_euler/problem_043/sol1.py)
* Problem 044
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_044/sol1.py)
+ * [Sol1](project_euler/problem_044/sol1.py)
* Problem 045
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_045/sol1.py)
+ * [Sol1](project_euler/problem_045/sol1.py)
* Problem 046
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_046/sol1.py)
+ * [Sol1](project_euler/problem_046/sol1.py)
* Problem 047
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_047/sol1.py)
+ * [Sol1](project_euler/problem_047/sol1.py)
* Problem 048
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_048/sol1.py)
+ * [Sol1](project_euler/problem_048/sol1.py)
* Problem 049
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_049/sol1.py)
+ * [Sol1](project_euler/problem_049/sol1.py)
* Problem 050
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_050/sol1.py)
+ * [Sol1](project_euler/problem_050/sol1.py)
* Problem 051
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_051/sol1.py)
+ * [Sol1](project_euler/problem_051/sol1.py)
* Problem 052
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_052/sol1.py)
+ * [Sol1](project_euler/problem_052/sol1.py)
* Problem 053
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_053/sol1.py)
+ * [Sol1](project_euler/problem_053/sol1.py)
* Problem 054
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_054/sol1.py)
- * [Test Poker Hand](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_054/test_poker_hand.py)
+ * [Sol1](project_euler/problem_054/sol1.py)
+ * [Test Poker Hand](project_euler/problem_054/test_poker_hand.py)
* Problem 055
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_055/sol1.py)
+ * [Sol1](project_euler/problem_055/sol1.py)
* Problem 056
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_056/sol1.py)
+ * [Sol1](project_euler/problem_056/sol1.py)
* Problem 057
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_057/sol1.py)
+ * [Sol1](project_euler/problem_057/sol1.py)
* Problem 058
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_058/sol1.py)
+ * [Sol1](project_euler/problem_058/sol1.py)
* Problem 059
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_059/sol1.py)
+ * [Sol1](project_euler/problem_059/sol1.py)
* Problem 062
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_062/sol1.py)
+ * [Sol1](project_euler/problem_062/sol1.py)
* Problem 063
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_063/sol1.py)
+ * [Sol1](project_euler/problem_063/sol1.py)
* Problem 064
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_064/sol1.py)
+ * [Sol1](project_euler/problem_064/sol1.py)
* Problem 065
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_065/sol1.py)
+ * [Sol1](project_euler/problem_065/sol1.py)
* Problem 067
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_067/sol1.py)
+ * [Sol1](project_euler/problem_067/sol1.py)
+ * [Sol2](project_euler/problem_067/sol2.py)
+ * Problem 068
+ * [Sol1](project_euler/problem_068/sol1.py)
* Problem 069
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_069/sol1.py)
+ * [Sol1](project_euler/problem_069/sol1.py)
* Problem 070
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_070/sol1.py)
+ * [Sol1](project_euler/problem_070/sol1.py)
* Problem 071
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_071/sol1.py)
+ * [Sol1](project_euler/problem_071/sol1.py)
* Problem 072
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_072/sol1.py)
- * [Sol2](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_072/sol2.py)
+ * [Sol1](project_euler/problem_072/sol1.py)
+ * [Sol2](project_euler/problem_072/sol2.py)
+ * Problem 073
+ * [Sol1](project_euler/problem_073/sol1.py)
* Problem 074
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_074/sol1.py)
- * [Sol2](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_074/sol2.py)
+ * [Sol1](project_euler/problem_074/sol1.py)
+ * [Sol2](project_euler/problem_074/sol2.py)
* Problem 075
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_075/sol1.py)
+ * [Sol1](project_euler/problem_075/sol1.py)
* Problem 076
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_076/sol1.py)
+ * [Sol1](project_euler/problem_076/sol1.py)
* Problem 077
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_077/sol1.py)
+ * [Sol1](project_euler/problem_077/sol1.py)
+ * Problem 078
+ * [Sol1](project_euler/problem_078/sol1.py)
+ * Problem 079
+ * [Sol1](project_euler/problem_079/sol1.py)
* Problem 080
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_080/sol1.py)
+ * [Sol1](project_euler/problem_080/sol1.py)
* Problem 081
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_081/sol1.py)
+ * [Sol1](project_euler/problem_081/sol1.py)
+ * Problem 082
+ * [Sol1](project_euler/problem_082/sol1.py)
* Problem 085
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_085/sol1.py)
+ * [Sol1](project_euler/problem_085/sol1.py)
* Problem 086
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_086/sol1.py)
+ * [Sol1](project_euler/problem_086/sol1.py)
* Problem 087
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_087/sol1.py)
+ * [Sol1](project_euler/problem_087/sol1.py)
* Problem 089
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_089/sol1.py)
+ * [Sol1](project_euler/problem_089/sol1.py)
* Problem 091
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_091/sol1.py)
+ * [Sol1](project_euler/problem_091/sol1.py)
+ * Problem 092
+ * [Sol1](project_euler/problem_092/sol1.py)
+ * Problem 094
+ * [Sol1](project_euler/problem_094/sol1.py)
+ * Problem 095
+ * [Sol1](project_euler/problem_095/sol1.py)
* Problem 097
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_097/sol1.py)
+ * [Sol1](project_euler/problem_097/sol1.py)
* Problem 099
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_099/sol1.py)
+ * [Sol1](project_euler/problem_099/sol1.py)
+ * Problem 100
+ * [Sol1](project_euler/problem_100/sol1.py)
* Problem 101
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_101/sol1.py)
+ * [Sol1](project_euler/problem_101/sol1.py)
* Problem 102
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_102/sol1.py)
+ * [Sol1](project_euler/problem_102/sol1.py)
+ * Problem 104
+ * [Sol1](project_euler/problem_104/sol1.py)
* Problem 107
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_107/sol1.py)
+ * [Sol1](project_euler/problem_107/sol1.py)
* Problem 109
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_109/sol1.py)
+ * [Sol1](project_euler/problem_109/sol1.py)
* Problem 112
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_112/sol1.py)
+ * [Sol1](project_euler/problem_112/sol1.py)
* Problem 113
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_113/sol1.py)
+ * [Sol1](project_euler/problem_113/sol1.py)
+ * Problem 114
+ * [Sol1](project_euler/problem_114/sol1.py)
+ * Problem 115
+ * [Sol1](project_euler/problem_115/sol1.py)
+ * Problem 116
+ * [Sol1](project_euler/problem_116/sol1.py)
+ * Problem 117
+ * [Sol1](project_euler/problem_117/sol1.py)
* Problem 119
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_119/sol1.py)
+ * [Sol1](project_euler/problem_119/sol1.py)
* Problem 120
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_120/sol1.py)
+ * [Sol1](project_euler/problem_120/sol1.py)
* Problem 121
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_121/sol1.py)
+ * [Sol1](project_euler/problem_121/sol1.py)
+ * Problem 122
+ * [Sol1](project_euler/problem_122/sol1.py)
* Problem 123
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_123/sol1.py)
+ * [Sol1](project_euler/problem_123/sol1.py)
* Problem 125
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_125/sol1.py)
+ * [Sol1](project_euler/problem_125/sol1.py)
* Problem 129
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_129/sol1.py)
+ * [Sol1](project_euler/problem_129/sol1.py)
+ * Problem 131
+ * [Sol1](project_euler/problem_131/sol1.py)
* Problem 135
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_135/sol1.py)
+ * [Sol1](project_euler/problem_135/sol1.py)
+ * Problem 136
+ * [Sol1](project_euler/problem_136/sol1.py)
* Problem 144
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_144/sol1.py)
+ * [Sol1](project_euler/problem_144/sol1.py)
+ * Problem 145
+ * [Sol1](project_euler/problem_145/sol1.py)
+ * Problem 164
+ * [Sol1](project_euler/problem_164/sol1.py)
* Problem 173
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_173/sol1.py)
+ * [Sol1](project_euler/problem_173/sol1.py)
* Problem 174
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_174/sol1.py)
+ * [Sol1](project_euler/problem_174/sol1.py)
* Problem 180
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_180/sol1.py)
+ * [Sol1](project_euler/problem_180/sol1.py)
+ * Problem 187
+ * [Sol1](project_euler/problem_187/sol1.py)
* Problem 188
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_188/sol1.py)
+ * [Sol1](project_euler/problem_188/sol1.py)
+ * Problem 190
+ * [Sol1](project_euler/problem_190/sol1.py)
* Problem 191
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_191/sol1.py)
+ * [Sol1](project_euler/problem_191/sol1.py)
* Problem 203
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_203/sol1.py)
+ * [Sol1](project_euler/problem_203/sol1.py)
+ * Problem 205
+ * [Sol1](project_euler/problem_205/sol1.py)
* Problem 206
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_206/sol1.py)
+ * [Sol1](project_euler/problem_206/sol1.py)
* Problem 207
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_207/sol1.py)
+ * [Sol1](project_euler/problem_207/sol1.py)
* Problem 234
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_234/sol1.py)
+ * [Sol1](project_euler/problem_234/sol1.py)
* Problem 301
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_301/sol1.py)
+ * [Sol1](project_euler/problem_301/sol1.py)
+ * Problem 345
+ * [Sol1](project_euler/problem_345/sol1.py)
+ * Problem 493
+ * [Sol1](project_euler/problem_493/sol1.py)
* Problem 551
- * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_551/sol1.py)
+ * [Sol1](project_euler/problem_551/sol1.py)
+ * Problem 587
+ * [Sol1](project_euler/problem_587/sol1.py)
+ * Problem 686
+ * [Sol1](project_euler/problem_686/sol1.py)
+ * Problem 800
+ * [Sol1](project_euler/problem_800/sol1.py)
## Quantum
- * [Deutsch Jozsa](https://github.com/TheAlgorithms/Python/blob/master/quantum/deutsch_jozsa.py)
- * [Half Adder](https://github.com/TheAlgorithms/Python/blob/master/quantum/half_adder.py)
- * [Not Gate](https://github.com/TheAlgorithms/Python/blob/master/quantum/not_gate.py)
- * [Quantum Entanglement](https://github.com/TheAlgorithms/Python/blob/master/quantum/quantum_entanglement.py)
- * [Ripple Adder Classic](https://github.com/TheAlgorithms/Python/blob/master/quantum/ripple_adder_classic.py)
- * [Single Qubit Measure](https://github.com/TheAlgorithms/Python/blob/master/quantum/single_qubit_measure.py)
+ * [Q Fourier Transform](quantum/q_fourier_transform.py)
## Scheduling
- * [First Come First Served](https://github.com/TheAlgorithms/Python/blob/master/scheduling/first_come_first_served.py)
- * [Round Robin](https://github.com/TheAlgorithms/Python/blob/master/scheduling/round_robin.py)
- * [Shortest Job First](https://github.com/TheAlgorithms/Python/blob/master/scheduling/shortest_job_first.py)
+ * [First Come First Served](scheduling/first_come_first_served.py)
+ * [Highest Response Ratio Next](scheduling/highest_response_ratio_next.py)
+ * [Job Sequence With Deadline](scheduling/job_sequence_with_deadline.py)
+ * [Job Sequencing With Deadline](scheduling/job_sequencing_with_deadline.py)
+ * [Multi Level Feedback Queue](scheduling/multi_level_feedback_queue.py)
+ * [Non Preemptive Shortest Job First](scheduling/non_preemptive_shortest_job_first.py)
+ * [Round Robin](scheduling/round_robin.py)
+ * [Shortest Job First](scheduling/shortest_job_first.py)
## Searches
- * [Binary Search](https://github.com/TheAlgorithms/Python/blob/master/searches/binary_search.py)
- * [Binary Tree Traversal](https://github.com/TheAlgorithms/Python/blob/master/searches/binary_tree_traversal.py)
- * [Double Linear Search](https://github.com/TheAlgorithms/Python/blob/master/searches/double_linear_search.py)
- * [Double Linear Search Recursion](https://github.com/TheAlgorithms/Python/blob/master/searches/double_linear_search_recursion.py)
- * [Fibonacci Search](https://github.com/TheAlgorithms/Python/blob/master/searches/fibonacci_search.py)
- * [Hill Climbing](https://github.com/TheAlgorithms/Python/blob/master/searches/hill_climbing.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)
- * [Simple Binary Search](https://github.com/TheAlgorithms/Python/blob/master/searches/simple_binary_search.py)
- * [Simulated Annealing](https://github.com/TheAlgorithms/Python/blob/master/searches/simulated_annealing.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)
+ * [Binary Search](searches/binary_search.py)
+ * [Binary Tree Traversal](searches/binary_tree_traversal.py)
+ * [Double Linear Search](searches/double_linear_search.py)
+ * [Double Linear Search Recursion](searches/double_linear_search_recursion.py)
+ * [Exponential Search](searches/exponential_search.py)
+ * [Fibonacci Search](searches/fibonacci_search.py)
+ * [Hill Climbing](searches/hill_climbing.py)
+ * [Interpolation Search](searches/interpolation_search.py)
+ * [Jump Search](searches/jump_search.py)
+ * [Linear Search](searches/linear_search.py)
+ * [Median Of Medians](searches/median_of_medians.py)
+ * [Quick Select](searches/quick_select.py)
+ * [Sentinel Linear Search](searches/sentinel_linear_search.py)
+ * [Simple Binary Search](searches/simple_binary_search.py)
+ * [Simulated Annealing](searches/simulated_annealing.py)
+ * [Tabu Search](searches/tabu_search.py)
+ * [Ternary Search](searches/ternary_search.py)
## Sorts
- * [Bead Sort](https://github.com/TheAlgorithms/Python/blob/master/sorts/bead_sort.py)
- * [Bitonic Sort](https://github.com/TheAlgorithms/Python/blob/master/sorts/bitonic_sort.py)
- * [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)
- * [Double Sort](https://github.com/TheAlgorithms/Python/blob/master/sorts/double_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)
- * [Intro Sort](https://github.com/TheAlgorithms/Python/blob/master/sorts/intro_sort.py)
- * [Iterative Merge Sort](https://github.com/TheAlgorithms/Python/blob/master/sorts/iterative_merge_sort.py)
- * [Merge Insertion Sort](https://github.com/TheAlgorithms/Python/blob/master/sorts/merge_insertion_sort.py)
- * [Merge Sort](https://github.com/TheAlgorithms/Python/blob/master/sorts/merge_sort.py)
- * [Msd Radix Sort](https://github.com/TheAlgorithms/Python/blob/master/sorts/msd_radix_sort.py)
- * [Natural Sort](https://github.com/TheAlgorithms/Python/blob/master/sorts/natural_sort.py)
- * [Odd Even Sort](https://github.com/TheAlgorithms/Python/blob/master/sorts/odd_even_sort.py)
- * [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)
- * [Pancake Sort](https://github.com/TheAlgorithms/Python/blob/master/sorts/pancake_sort.py)
- * [Patience Sort](https://github.com/TheAlgorithms/Python/blob/master/sorts/patience_sort.py)
- * [Pigeon Sort](https://github.com/TheAlgorithms/Python/blob/master/sorts/pigeon_sort.py)
- * [Pigeonhole Sort](https://github.com/TheAlgorithms/Python/blob/master/sorts/pigeonhole_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)
- * [Recursive Bubble Sort](https://github.com/TheAlgorithms/Python/blob/master/sorts/recursive_bubble_sort.py)
- * [Recursive Insertion Sort](https://github.com/TheAlgorithms/Python/blob/master/sorts/recursive_insertion_sort.py)
- * [Recursive Mergesort Array](https://github.com/TheAlgorithms/Python/blob/master/sorts/recursive_mergesort_array.py)
- * [Recursive Quick Sort](https://github.com/TheAlgorithms/Python/blob/master/sorts/recursive_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)
- * [Slowsort](https://github.com/TheAlgorithms/Python/blob/master/sorts/slowsort.py)
- * [Stooge Sort](https://github.com/TheAlgorithms/Python/blob/master/sorts/stooge_sort.py)
- * [Strand Sort](https://github.com/TheAlgorithms/Python/blob/master/sorts/strand_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)
- * [Unknown Sort](https://github.com/TheAlgorithms/Python/blob/master/sorts/unknown_sort.py)
- * [Wiggle Sort](https://github.com/TheAlgorithms/Python/blob/master/sorts/wiggle_sort.py)
+ * [Bead Sort](sorts/bead_sort.py)
+ * [Binary Insertion Sort](sorts/binary_insertion_sort.py)
+ * [Bitonic Sort](sorts/bitonic_sort.py)
+ * [Bogo Sort](sorts/bogo_sort.py)
+ * [Bubble Sort](sorts/bubble_sort.py)
+ * [Bucket Sort](sorts/bucket_sort.py)
+ * [Circle Sort](sorts/circle_sort.py)
+ * [Cocktail Shaker Sort](sorts/cocktail_shaker_sort.py)
+ * [Comb Sort](sorts/comb_sort.py)
+ * [Counting Sort](sorts/counting_sort.py)
+ * [Cycle Sort](sorts/cycle_sort.py)
+ * [Cyclic Sort](sorts/cyclic_sort.py)
+ * [Double Sort](sorts/double_sort.py)
+ * [Dutch National Flag Sort](sorts/dutch_national_flag_sort.py)
+ * [Exchange Sort](sorts/exchange_sort.py)
+ * [External Sort](sorts/external_sort.py)
+ * [Gnome Sort](sorts/gnome_sort.py)
+ * [Heap Sort](sorts/heap_sort.py)
+ * [Insertion Sort](sorts/insertion_sort.py)
+ * [Intro Sort](sorts/intro_sort.py)
+ * [Iterative Merge Sort](sorts/iterative_merge_sort.py)
+ * [Merge Insertion Sort](sorts/merge_insertion_sort.py)
+ * [Merge Sort](sorts/merge_sort.py)
+ * [Msd Radix Sort](sorts/msd_radix_sort.py)
+ * [Natural Sort](sorts/natural_sort.py)
+ * [Odd Even Sort](sorts/odd_even_sort.py)
+ * [Odd Even Transposition Parallel](sorts/odd_even_transposition_parallel.py)
+ * [Odd Even Transposition Single Threaded](sorts/odd_even_transposition_single_threaded.py)
+ * [Pancake Sort](sorts/pancake_sort.py)
+ * [Patience Sort](sorts/patience_sort.py)
+ * [Pigeon Sort](sorts/pigeon_sort.py)
+ * [Pigeonhole Sort](sorts/pigeonhole_sort.py)
+ * [Quick Sort](sorts/quick_sort.py)
+ * [Quick Sort 3 Partition](sorts/quick_sort_3_partition.py)
+ * [Radix Sort](sorts/radix_sort.py)
+ * [Recursive Insertion Sort](sorts/recursive_insertion_sort.py)
+ * [Recursive Mergesort Array](sorts/recursive_mergesort_array.py)
+ * [Recursive Quick Sort](sorts/recursive_quick_sort.py)
+ * [Selection Sort](sorts/selection_sort.py)
+ * [Shell Sort](sorts/shell_sort.py)
+ * [Shrink Shell Sort](sorts/shrink_shell_sort.py)
+ * [Slowsort](sorts/slowsort.py)
+ * [Stalin Sort](sorts/stalin_sort.py)
+ * [Stooge Sort](sorts/stooge_sort.py)
+ * [Strand Sort](sorts/strand_sort.py)
+ * [Tim Sort](sorts/tim_sort.py)
+ * [Topological Sort](sorts/topological_sort.py)
+ * [Tree Sort](sorts/tree_sort.py)
+ * [Unknown Sort](sorts/unknown_sort.py)
+ * [Wiggle Sort](sorts/wiggle_sort.py)
## Strings
- * [Aho Corasick](https://github.com/TheAlgorithms/Python/blob/master/strings/aho_corasick.py)
- * [Anagrams](https://github.com/TheAlgorithms/Python/blob/master/strings/anagrams.py)
- * [Autocomplete Using Trie](https://github.com/TheAlgorithms/Python/blob/master/strings/autocomplete_using_trie.py)
- * [Boyer Moore Search](https://github.com/TheAlgorithms/Python/blob/master/strings/boyer_moore_search.py)
- * [Can String Be Rearranged As Palindrome](https://github.com/TheAlgorithms/Python/blob/master/strings/can_string_be_rearranged_as_palindrome.py)
- * [Capitalize](https://github.com/TheAlgorithms/Python/blob/master/strings/capitalize.py)
- * [Check Anagrams](https://github.com/TheAlgorithms/Python/blob/master/strings/check_anagrams.py)
- * [Check Pangram](https://github.com/TheAlgorithms/Python/blob/master/strings/check_pangram.py)
- * [Detecting English Programmatically](https://github.com/TheAlgorithms/Python/blob/master/strings/detecting_english_programmatically.py)
- * [Frequency Finder](https://github.com/TheAlgorithms/Python/blob/master/strings/frequency_finder.py)
- * [Is Palindrome](https://github.com/TheAlgorithms/Python/blob/master/strings/is_palindrome.py)
- * [Jaro Winkler](https://github.com/TheAlgorithms/Python/blob/master/strings/jaro_winkler.py)
- * [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)
- * [Lower](https://github.com/TheAlgorithms/Python/blob/master/strings/lower.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)
- * [Naive String Search](https://github.com/TheAlgorithms/Python/blob/master/strings/naive_string_search.py)
- * [Palindrome](https://github.com/TheAlgorithms/Python/blob/master/strings/palindrome.py)
- * [Prefix Function](https://github.com/TheAlgorithms/Python/blob/master/strings/prefix_function.py)
- * [Rabin Karp](https://github.com/TheAlgorithms/Python/blob/master/strings/rabin_karp.py)
- * [Remove Duplicate](https://github.com/TheAlgorithms/Python/blob/master/strings/remove_duplicate.py)
- * [Reverse Letters](https://github.com/TheAlgorithms/Python/blob/master/strings/reverse_letters.py)
- * [Reverse Words](https://github.com/TheAlgorithms/Python/blob/master/strings/reverse_words.py)
- * [Split](https://github.com/TheAlgorithms/Python/blob/master/strings/split.py)
- * [Swap Case](https://github.com/TheAlgorithms/Python/blob/master/strings/swap_case.py)
- * [Upper](https://github.com/TheAlgorithms/Python/blob/master/strings/upper.py)
- * [Word Occurrence](https://github.com/TheAlgorithms/Python/blob/master/strings/word_occurrence.py)
- * [Word Patterns](https://github.com/TheAlgorithms/Python/blob/master/strings/word_patterns.py)
- * [Z Function](https://github.com/TheAlgorithms/Python/blob/master/strings/z_function.py)
+ * [Aho Corasick](strings/aho_corasick.py)
+ * [Alternative String Arrange](strings/alternative_string_arrange.py)
+ * [Anagrams](strings/anagrams.py)
+ * [Autocomplete Using Trie](strings/autocomplete_using_trie.py)
+ * [Barcode Validator](strings/barcode_validator.py)
+ * [Bitap String Match](strings/bitap_string_match.py)
+ * [Boyer Moore Search](strings/boyer_moore_search.py)
+ * [Camel Case To Snake Case](strings/camel_case_to_snake_case.py)
+ * [Can String Be Rearranged As Palindrome](strings/can_string_be_rearranged_as_palindrome.py)
+ * [Capitalize](strings/capitalize.py)
+ * [Check Anagrams](strings/check_anagrams.py)
+ * [Count Vowels](strings/count_vowels.py)
+ * [Credit Card Validator](strings/credit_card_validator.py)
+ * [Damerau Levenshtein Distance](strings/damerau_levenshtein_distance.py)
+ * [Detecting English Programmatically](strings/detecting_english_programmatically.py)
+ * [Dna](strings/dna.py)
+ * [Edit Distance](strings/edit_distance.py)
+ * [Frequency Finder](strings/frequency_finder.py)
+ * [Hamming Distance](strings/hamming_distance.py)
+ * [Indian Phone Validator](strings/indian_phone_validator.py)
+ * [Is Contains Unique Chars](strings/is_contains_unique_chars.py)
+ * [Is Isogram](strings/is_isogram.py)
+ * [Is Pangram](strings/is_pangram.py)
+ * [Is Polish National Id](strings/is_polish_national_id.py)
+ * [Is Spain National Id](strings/is_spain_national_id.py)
+ * [Is Srilankan Phone Number](strings/is_srilankan_phone_number.py)
+ * [Is Valid Email Address](strings/is_valid_email_address.py)
+ * [Jaro Winkler](strings/jaro_winkler.py)
+ * [Join](strings/join.py)
+ * [Knuth Morris Pratt](strings/knuth_morris_pratt.py)
+ * [Levenshtein Distance](strings/levenshtein_distance.py)
+ * [Lower](strings/lower.py)
+ * [Manacher](strings/manacher.py)
+ * [Min Cost String Conversion](strings/min_cost_string_conversion.py)
+ * [Naive String Search](strings/naive_string_search.py)
+ * [Ngram](strings/ngram.py)
+ * [Palindrome](strings/palindrome.py)
+ * [Pig Latin](strings/pig_latin.py)
+ * [Prefix Function](strings/prefix_function.py)
+ * [Rabin Karp](strings/rabin_karp.py)
+ * [Remove Duplicate](strings/remove_duplicate.py)
+ * [Reverse Letters](strings/reverse_letters.py)
+ * [Reverse Words](strings/reverse_words.py)
+ * [Snake Case To Camel Pascal Case](strings/snake_case_to_camel_pascal_case.py)
+ * [Split](strings/split.py)
+ * [String Switch Case](strings/string_switch_case.py)
+ * [Strip](strings/strip.py)
+ * [Suffix Automaton](strings/suffix_automaton.py)
+ * [Text Justification](strings/text_justification.py)
+ * [Title](strings/title.py)
+ * [Top K Frequent Words](strings/top_k_frequent_words.py)
+ * [Upper](strings/upper.py)
+ * [Wave String](strings/wave_string.py)
+ * [Wildcard Pattern Matching](strings/wildcard_pattern_matching.py)
+ * [Word Occurrence](strings/word_occurrence.py)
+ * [Word Patterns](strings/word_patterns.py)
+ * [Z Function](strings/z_function.py)
## Web Programming
- * [Co2 Emission](https://github.com/TheAlgorithms/Python/blob/master/web_programming/co2_emission.py)
- * [Covid Stats Via Xpath](https://github.com/TheAlgorithms/Python/blob/master/web_programming/covid_stats_via_xpath.py)
- * [Crawl Google Results](https://github.com/TheAlgorithms/Python/blob/master/web_programming/crawl_google_results.py)
- * [Crawl Google Scholar Citation](https://github.com/TheAlgorithms/Python/blob/master/web_programming/crawl_google_scholar_citation.py)
- * [Currency Converter](https://github.com/TheAlgorithms/Python/blob/master/web_programming/currency_converter.py)
- * [Current Stock Price](https://github.com/TheAlgorithms/Python/blob/master/web_programming/current_stock_price.py)
- * [Current Weather](https://github.com/TheAlgorithms/Python/blob/master/web_programming/current_weather.py)
- * [Daily Horoscope](https://github.com/TheAlgorithms/Python/blob/master/web_programming/daily_horoscope.py)
- * [Emails From Url](https://github.com/TheAlgorithms/Python/blob/master/web_programming/emails_from_url.py)
- * [Fetch Bbc News](https://github.com/TheAlgorithms/Python/blob/master/web_programming/fetch_bbc_news.py)
- * [Fetch Github Info](https://github.com/TheAlgorithms/Python/blob/master/web_programming/fetch_github_info.py)
- * [Fetch Jobs](https://github.com/TheAlgorithms/Python/blob/master/web_programming/fetch_jobs.py)
- * [Get Imdb Top 250 Movies Csv](https://github.com/TheAlgorithms/Python/blob/master/web_programming/get_imdb_top_250_movies_csv.py)
- * [Get Imdbtop](https://github.com/TheAlgorithms/Python/blob/master/web_programming/get_imdbtop.py)
- * [Instagram Crawler](https://github.com/TheAlgorithms/Python/blob/master/web_programming/instagram_crawler.py)
- * [Instagram Pic](https://github.com/TheAlgorithms/Python/blob/master/web_programming/instagram_pic.py)
- * [Instagram Video](https://github.com/TheAlgorithms/Python/blob/master/web_programming/instagram_video.py)
- * [Recaptcha Verification](https://github.com/TheAlgorithms/Python/blob/master/web_programming/recaptcha_verification.py)
- * [Slack Message](https://github.com/TheAlgorithms/Python/blob/master/web_programming/slack_message.py)
- * [Test Fetch Github Info](https://github.com/TheAlgorithms/Python/blob/master/web_programming/test_fetch_github_info.py)
- * [World Covid19 Stats](https://github.com/TheAlgorithms/Python/blob/master/web_programming/world_covid19_stats.py)
+ * [Co2 Emission](web_programming/co2_emission.py)
+ * [Covid Stats Via Xpath](web_programming/covid_stats_via_xpath.py)
+ * [Crawl Google Results](web_programming/crawl_google_results.py)
+ * [Crawl Google Scholar Citation](web_programming/crawl_google_scholar_citation.py)
+ * [Currency Converter](web_programming/currency_converter.py)
+ * [Current Stock Price](web_programming/current_stock_price.py)
+ * [Current Weather](web_programming/current_weather.py)
+ * [Daily Horoscope](web_programming/daily_horoscope.py)
+ * [Download Images From Google Query](web_programming/download_images_from_google_query.py)
+ * [Emails From Url](web_programming/emails_from_url.py)
+ * [Fetch Anime And Play](web_programming/fetch_anime_and_play.py)
+ * [Fetch Bbc News](web_programming/fetch_bbc_news.py)
+ * [Fetch Github Info](web_programming/fetch_github_info.py)
+ * [Fetch Jobs](web_programming/fetch_jobs.py)
+ * [Fetch Quotes](web_programming/fetch_quotes.py)
+ * [Fetch Well Rx Price](web_programming/fetch_well_rx_price.py)
+ * [Get Amazon Product Data](web_programming/get_amazon_product_data.py)
+ * [Get Imdb Top 250 Movies Csv](web_programming/get_imdb_top_250_movies_csv.py)
+ * [Get Ip Geolocation](web_programming/get_ip_geolocation.py)
+ * [Get Top Billionaires](web_programming/get_top_billionaires.py)
+ * [Get Top Hn Posts](web_programming/get_top_hn_posts.py)
+ * [Giphy](web_programming/giphy.py)
+ * [Instagram Crawler](web_programming/instagram_crawler.py)
+ * [Instagram Pic](web_programming/instagram_pic.py)
+ * [Instagram Video](web_programming/instagram_video.py)
+ * [Nasa Data](web_programming/nasa_data.py)
+ * [Open Google Results](web_programming/open_google_results.py)
+ * [Random Anime Character](web_programming/random_anime_character.py)
+ * [Recaptcha Verification](web_programming/recaptcha_verification.py)
+ * [Reddit](web_programming/reddit.py)
+ * [Search Books By Isbn](web_programming/search_books_by_isbn.py)
+ * [Slack Message](web_programming/slack_message.py)
+ * [Test Fetch Github Info](web_programming/test_fetch_github_info.py)
+ * [World Covid19 Stats](web_programming/world_covid19_stats.py)
diff --git a/LICENSE.md b/LICENSE.md
index c3c2857cd312..de631c3ef333 100644
--- a/LICENSE.md
+++ b/LICENSE.md
@@ -1,6 +1,6 @@
-MIT License
+## MIT License
-Copyright (c) 2016-2021 The Algorithms
+Copyright (c) 2016-2022 TheAlgorithms and contributors
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
diff --git a/README.md b/README.md
index 1e85ed0daa7c..182d36a8d905 100644
--- a/README.md
+++ b/README.md
@@ -1,28 +1,52 @@
-# The Algorithms - Python
-[](https://gitpod.io/#https://github.com/TheAlgorithms/Python)
-[](https://discord.gg/c7MnfGFGa6)
-[](https://gitter.im/TheAlgorithms)
-[](https://github.com/TheAlgorithms/Python/actions)
-[](https://lgtm.com/projects/g/TheAlgorithms/Python/alerts)
-[](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md)
-[](https://www.paypal.me/TheAlgorithms/100)
-
-[](https://github.com/pre-commit/pre-commit)
-[](https://github.com/psf/black)
-
-
-### All algorithms implemented in Python (for education)
-
-These implementations are for learning purposes only. Therefore they may be less efficient than the implementations in the Python standard library.
-
-## Contribution Guidelines
-
-Read our [Contribution Guidelines](CONTRIBUTING.md) before you contribute.
-
-## Community Channel
-
-We're on [Gitter](https://gitter.im/TheAlgorithms)! Please join us.
-
-## List of Algorithms
-
-See our [directory](DIRECTORY.md).
+
+
+
+ 
+
+
+
+
+
+
+ 
+
+
+ 
+
+
+
+ 
+
+
+ 
+
+
+
+
+
+ 
+
+
+ 
+
+
+ 
+
+
+
+
All algorithms implemented in Python - for education 📚
+