init

Author: abranhe

.editorconfig

@@ -0,0 +1,19 @@
+
+# EditorConfig
+# https://EditorConfig.org
+#
+# Build with init-editorconfig
+# https://github.com/abranhe/init-editorconfig
+
+root = true
+
+[*]
+indent_style = tab
+end_of_line = lf
+charset = utf-8
+trim_trailing_whitespace = true
+insert_final_newline = true
+
+[*.yml]
+indent_style = space
+indent_size = 2

.gitignore

@@ -0,0 +1,104 @@
+# Byte-compiled / optimized / DLL files
+__pycache__/
+*.py[cod]
+*$py.class
+
+# C extensions
+*.so
+
+# Distribution / packaging
+.Python
+build/
+develop-eggs/
+dist/
+downloads/
+eggs/
+.eggs/
+lib/
+lib64/
+parts/
+sdist/
+var/
+wheels/
+*.egg-info/
+.installed.cfg
+*.egg
+MANIFEST
+
+# PyInstaller
+#  Usually these files are written by a python script from a template
+#  before PyInstaller builds the exe, so as to inject date/other infos into it.
+*.manifest
+*.spec
+
+# Installer logs
+pip-log.txt
+pip-delete-this-directory.txt
+
+# Unit test / coverage reports
+htmlcov/
+.tox/
+.coverage
+.coverage.*
+.cache
+nosetests.xml
+coverage.xml
+*.cover
+.hypothesis/
+.pytest_cache/
+
+# Translations
+*.mo
+*.pot
+
+# Django stuff:
+*.log
+local_settings.py
+db.sqlite3
+
+# Flask stuff:
+instance/
+.webassets-cache
+
+# Scrapy stuff:
+.scrapy
+
+# Sphinx documentation
+docs/_build/
+
+# PyBuilder
+target/
+
+# Jupyter Notebook
+.ipynb_checkpoints
+
+# pyenv
+.python-version
+
+# celery beat schedule file
+celerybeat-schedule
+
+# SageMath parsed files
+*.sage.py
+
+# Environments
+.env
+.venv
+env/
+venv/
+ENV/
+env.bak/
+venv.bak/
+
+# Spyder project settings
+.spyderproject
+.spyproject
+
+# Rope project settings
+.ropeproject
+
+# mkdocs documentation
+/site
+
+# mypy
+.mypy_cache/

.travis.yml

@@ -0,0 +1,43 @@
+group: travis_latest
+language: python
+cache:
+  directories:
+    - $HOME/.cache/pip
+matrix:
+    include:
+        - python: 3.4
+          env: TOX_ENV=py34
+        - python: 3.5
+          env: TOX_ENV=py35,coverage
+        - python: 3.6
+          env: TOX_ENV=py36
+install:
+    - pip install -r tests/test_requirements.txt
+before_script:
+    # stop the build if there are Python syntax errors or undefined names
+    - flake8 . --count --select=E901,E999,F821,F822,F823 --show-source --statistics
+    # exit-zero treats all errors as warnings.  The GitHub editor is 127 chars wide
+    - flake8 . --count --exit-zero --max-complexity=10 --max-line-length=127 --statistics
+script:
+    - pip3 install -e .
+    - tox -e $TOX_ENV
+    # Check python uninstall package
+    - pip3 uninstall -y algorithms
+notifications:
+    email: false
+
+
+language: python
+
+python:
+  - "3.3"
+  - "3.4"
+
+install:
+  - pip install codecov
+
+script:
+  - coverage run test.py
+
+notifications:
+  email: false

allalgorithms/.editorconfig

@@ -0,0 +1,18 @@
+# EditorConfig
+# https://EditorConfig.org
+#
+# Build with init-editorconfig
+# https://github.com/abranhe/init-editorconfig
+
+root = true
+
+[*]
+indent_style = tab
+end_of_line = lf
+charset = utf-8
+trim_trailing_whitespace = true
+insert_final_newline = true
+
+[*.yml]
+indent_style = space
+indent_size = 2

allalgorithms/__init__.py

@@ -0,0 +1 @@
+from .binary_search import *

allalgorithms/searches/__init__.py

@@ -0,0 +1,20 @@
+# -*- coding: UTF-8 -*-
+#
+# Binary search works for a sorted array.
+# The All ▲lgorithms library for python
+#
+# Contributed by: Carlos Abraham Hernandez
+# Github: @abranhe
+#
+def binary_search(arr, query):
+    lo, hi = 0, len(arr) - 1
+    while lo <= hi:
+        mid = (hi + lo) // 2
+        val = arr[mid]
+        if val == query:
+            return mid
+        elif val < query:
+            lo = mid + 1
+        else:
+            hi = mid - 1
+    return None

allalgorithms/searches/binary_search.py

@@ -0,0 +1 @@
+from .merge_sort import *

allalgorithms/sorting/__init__.py

@@ -0,0 +1,26 @@
+# -*- coding: UTF-8 -*-
+#
+# Merge Sort Algorithm
+# The All ▲lgorithms library for python
+#
+# Contributed by: Carlos Abraham Hernandez
+# Github: @abranhe
+#
+def merge_sort(arr):
+    if len(arr) == 1:
+        return arr
+
+    left = merge_sort(arr[:(len(arr)//2)])
+    right = merge_sort(arr[(len(arr)//2):])
+    out = []
+
+    while bool(left) or bool(right):
+        if bool(left) ^ bool(right):
+            alias = left if left else right
+        else:
+            alias = left if left[0] < right[0] else right
+
+        out.append(alias[0])
+        alias.remove(alias[0])
+
+    return out

allalgorithms/sorting/merge_sort.py

@@ -0,0 +1,14 @@
+<div align="left">
+<img src="https://cdn.abraham.gq/projects/algorithms/algorithms.svg" alt="Algorithms"> <img src="http://konpa.github.io/devicon/devicon.git/icons/python/python-original.svg" width="50px">
+<div>
+
+# Version `0.0.0`
+
+Date: October 9, 2018
+
+### Algorithms:
+
+- Sorting
+  - Bubble Sort
+- Searches
+  - Merge Sort

changelog.md

@@ -0,0 +1,95 @@
+<div align="center">
+	<a href="https://pypi.org/project/allalgorithms"><img src="https://cdn.abranhe.com/projects/algorithms/logo.svg" width="30%"></a>
+	<br>
+	<br>
+	<br>
+	<br>
+	The All ▲lgorithms Python library
+	<br>
+	<br>
+</p>
+
+[![All Algorithms Badge][1]][2]
+[![Travis][travis-img]][travis-link]
+[![License][license-img]][license-link]
+[![pypi][pypi]][pypi-link]
+
+	<br>
+	<br>
+	<br>
+	<br>
+
+	[`python.allalgorithms.com`](https://python.allalgorithms.com)
+
+</div>
+
+# Why?
+
+- Why not 😂
+- Clean and focused
+- Actively maintained
+- Because All Algorithms should easy to use in Python
+
+## Install
+
+```
+pip install allalgorithms
+```
+
+## Usage Example
+
+```py
+from allalgorithms.searches import binary_search
+
+arr = [-2, 1, 2, 7, 10, 77]
+
+print(binary_search(arr, 7))
+# -> 3
+
+print(binary_search(arr, 3))
+# -> None
+```
+
+# Tree
+
+- Searches
+  - [Binary Search](binary_search)
+- Sorting
+	 - [Merge Sort](merge_sort)
+
+
+# Related
+
+- [javascript-lib](https://github.com/abranhe/javascript-lib): All ▲lgorithms Javascript library
+
+# Maintainers
+
+|[![Carlos Abraham Logo][3]][4]|
+| :--------------------------: |
+| [Carlos Abraham][4]          |
+
+
+# License
+
+[MIT][5] License © [Carlos Abraham][4]
+
+<!-------------------Markdown Images Links ---------------------------------->
+[1]: https://cdn.abranhe.com/projects/algorithms/badge.svg
+[2]: https://github.com/abranhe/python-lib
+[3]: https://avatars3.githubusercontent.com/u/21347264?s=50
+[4]: https://github.com/abranhe
+[5]: https://github.com/abranhe/python-lib/blob/master/LICENSE
+[travis-link]: https://travis-ci.org/abranhe/python-lib
+[travis-img]: https://img.shields.io/travis/abranhe/python-lib.svg?logo=travis
+[license-link]: https://github.com/abranhe/python-lib/blob/master/LICENSE
+[license-img]: https://img.shields.io/github/license/abranhe/python-lib.svg
+[pypi]: https://img.shields.io/pypi/v/allalgorithms.svg
+[pypi-link]: https://pypi.org/project/allalgorithms
+<!-------------------Markdown Images Links ---------------------------------->
+
+<div align="center">
+	<a href="https://github.com/abranhe/algorithms">
+		<img src="https://cdn.abranhe.com/projects/algorithms/logo.svg" width="50px">
+	</a>
+  <br>
+</div>

docs/readme.md

@@ -0,0 +1,34 @@
+# Binary Search
+
+In computer science, binary search, also known as half-interval search, logarithmic search, or binary chop, is a search algorithm that finds the position of a target value within a sorted array
+
+## Install
+
+```
+pip install allalgorithms
+```
+
+## Usage
+
+```py
+from allalgorithms.searches import binary_search
+
+arr = [-2, 1, 2, 7, 10, 77]
+
+print(binary_search(arr, 7))
+# -> 3
+
+print(binary_search(arr, 3))
+# -> None
+```
+
+## API
+
+### binary_search(array, query)
+
+> Return array index if its found, otherwise returns `None`
+
+##### Params:
+
+- `array`: Sorted Array
+- `query`: Element to search for in the array