OpenSoure_Repos/TheAlgorithms-Python
1
0
Fork 0
mirror of https://hub.njuu.cf/TheAlgorithms/Python.git synced 2023-10-11 13:06:12 +08:00
Code Issues Packages Projects Releases Wiki Activity

Insertion sort : type hint, docstring (#2327)

Browse Source 
* insertion sort : docstring, type hinting

* Update insertion_sort.py

Co-authored-by: Christian Clauss <cclauss@me.com>
This commit is contained in:
Guillaume Rochedix 2020-08-23 04:35:54 +02:00 committed by GitHub
parent a46b5559e0
commit ee28deea4a
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 10 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

17
sorts/insertion_sort.py
View File

@ -1,18 +1,21 @@
"""
This is a pure Python implementation of the insertion sort algorithm
A pure Python implementation of the insertion sort algorithm
This algorithm sorts a collection by comparing adjacent elements.
When it finds that order is not respected, it moves the element compared
backward until the order is correct. It then goes back directly to the
element's initial position resuming forward comparison.
For doctests run following command:
python -m doctest -v insertion_sort.py
or
python3 -m doctest -v insertion_sort.py
For manual testing run:
python insertion_sort.py
python3 insertion_sort.py
"""
def insertion_sort(collection):
"""Pure implementation of the insertion sort algorithm in Python
def insertion_sort(collection: list) -> list:
"""A pure Python implementation of the insertion sort algorithm
:param collection: some mutable ordered collection with heterogeneous
comparable items inside
@ -47,4 +50,4 @@ def insertion_sort(collection):
if __name__ == "__main__":
user_input = input("Enter numbers separated by a comma:\n").strip()
unsorted = [int(item) for item in user_input.split(",")]
print(insertion_sort(unsorted))
print(f"{insertion_sort(unsorted) = }")