mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-01-18 16:27:02 +00:00
Code Issues Packages Projects Releases Wiki Activity

Fix pre-commit error on master (#3992)

Browse Source 
* Update pigeon_sort.py

* updating DIRECTORY.md

* Add type hints and return annotation

Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
This commit is contained in:
Dhruv Manilawala 2020-11-30 21:03:29 +05:30 committed by GitHub
parent 07a4ce9fb8
commit f8b2c43fda
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
2 changed files with 4 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

1
DIRECTORY.md
View File

@ -250,6 +250,7 @@
* [Sum Of Subset](https://github.com/TheAlgorithms/Python/blob/master/dynamic_programming/sum_of_subset.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)
## File Transfer

4
sorts/pigeon_sort.py
View File

@ -9,9 +9,10 @@
For manual testing run:
python pigeon_sort.py
"""
from typing import List
def pigeon_sort(array):
def pigeon_sort(array: List[int]) -> List[int]:
"""
Implementation of pigeon hole sort algorithm
:param array: Collection of comparable items
@ -52,6 +53,7 @@ def pigeon_sort(array):
if __name__ == "__main__":
import doctest
doctest.testmod()
user_input = input("Enter numbers separated by comma:\n")
unsorted = [int(x) for x in user_input.split(",")]