mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-04-03 12:26:44 +00:00
Code Issues Packages Projects Releases Wiki Activity

Update pigeon_sort.py (#2359)

Browse Source 
* Update pigeon_sort.py

* Update pigeon_sort.py

* Update pigeon_sort.py
This commit is contained in:
wuyudi 2020-11-30 22:59:23 +08:00 committed by GitHub
parent daceb87a96
commit 07a4ce9fb8
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 9 additions and 19 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

26
sorts/pigeon_sort.py
View File

@ -26,28 +26,16 @@ def pigeon_sort(array):
if len(array) == 0: if len(array) == 0:
return array return array
# Manually finds the minimum and maximum of the array. _min, _max = min(array), max(array)
min = array[0]
max = array[0]
for i in range(len(array)):
if array[i] < min:
min = array[i]
elif array[i] > max:
max = array[i]
# Compute the variables # Compute the variables
holes_range = max - min + 1 holes_range = _max - _min + 1
holes = [0 for _ in range(holes_range)] holes, holes_repeat = [0] * holes_range, [0] * holes_range
holes_repeat = [0 for _ in range(holes_range)]
# Make the sorting. # Make the sorting.
for i in range(len(array)): for i in array:
index = array[i] - min index = i - _min
if holes[index] != array[i]: holes[index] = i
holes[index] = array[i]
holes_repeat[index] += 1
else:
holes_repeat[index] += 1 holes_repeat[index] += 1
# Makes the array back by replacing the numbers. # Makes the array back by replacing the numbers.
@ -63,6 +51,8 @@ def pigeon_sort(array):
if __name__ == "__main__": if __name__ == "__main__":
import doctest
doctest.testmod()
user_input = input("Enter numbers separated by comma:\n") user_input = input("Enter numbers separated by comma:\n")
unsorted = [int(x) for x in user_input.split(",")] unsorted = [int(x) for x in user_input.split(",")]
print(pigeon_sort(unsorted)) print(pigeon_sort(unsorted))