| FazBrowse GitHub Viewer | Trending | | Home |
| Tools: [Download Repo ZIP] [Original HTTPS Page] |
Please note that this project is released with a Contributor Code of Conduct. By participating in this project you agree to abide by its terms.
We follow this structure
├── allalgorithms
│ │── sorting
| | │── bubble_sort.py
| | └── merge_sort.py
│ └── searches
| │── binary_search.py
| └── linear_search.py
├── docs
│ │── sorting
| | │── bubble-sort.md
| | └── merge-sort.md
│ └── searches
| │── binary-search.md
| └── linear-search.md
└── tests
│── test_searches.py
└── test_sorting.py
Please DO NOT EDIT CHANGELOG on your pull requests, this is must be edited by one of the write access maintainers when they going to drop a new release.
This repository follow the PEP8 Style Gide for Python, so make sure you lint your code before adding a new pull request.
Each .py file should have the following header. (no for testing files)
# -*- coding: UTF-8 -*-
#
# Binary search works for a sorted array.
# The All ▲lgorithms library for python
#
# Contributed by: Carlos Abraham Hernandez
# Github: @abranhe
#If the algorithm is modified, this should be included there also.
# Contributed by: Carlos Abraham Hernandez
# Github: @abranhe
#
# Modified by: Your Name
# Github: @yourgithubusernameIf the algorithm have been modified by multiple contributors, that should be included as follow.
# Contributed by: Carlos Abraham Hernandez
# Github: @abranhe
#
# Modifiers:
# Your Name, @yourgithubusername
# Your friend's name, @yourfriendongithubPlease make sure if you add an algorithm, you also add the required documentation for it the /docs directory.
Follow some of the examples already added.
If you are modifying an algorithm make sure you add a benchmark using Repl.it for the maintainers to have it easy to review it.
Make sure you start ⭐️ the project and follow @abranhe
| Back | FazBrowse Home | New Git URL |