mirror of
https://github.com/autistic-symposium/master-algorithms-py.git
synced 2025-04-29 20:26:07 -04:00
Update bucket_sort.py
This commit is contained in:
parent
d357be4e52
commit
02c26f8d8a
@ -1,23 +1,23 @@
|
|||||||
#!/usr/bin/env python3
|
#!/usr/bin/env python3
|
||||||
# -*- coding: utf-8 -*-
|
# -*- coding: utf-8 -*-
|
||||||
# author: bt3gl
|
|
||||||
|
|
||||||
def bucket_sort(list):
|
|
||||||
|
|
||||||
buckets = [[] for _ in range(K)]
|
def bucket_sort(array, k):
|
||||||
|
|
||||||
shift = min(lst)
|
buckets = [[] for _ in range(k)]
|
||||||
max_val = max(lst) - shift
|
|
||||||
bucket_size = max(1, max_val / K)
|
|
||||||
|
|
||||||
for i, elem in enumerate(lst):
|
shift = min(array)
|
||||||
|
max_val = max(array) - shift
|
||||||
|
bucket_size = max(1, max_val / k)
|
||||||
|
|
||||||
index = (elem - shift) // bucket_size
|
for i, e in enumerate(array):
|
||||||
|
|
||||||
if index == K:
|
index = (e - shift) // bucket_size
|
||||||
buckets[K - 1].append(elem)
|
|
||||||
|
if index == k:
|
||||||
|
buckets[k - 1].append(e)
|
||||||
else:
|
else:
|
||||||
buckets[index].append(elem)
|
buckets[index].append(e)
|
||||||
|
|
||||||
for bucket in buckets:
|
for bucket in buckets:
|
||||||
bucket.sort()
|
bucket.sort()
|
||||||
@ -26,5 +26,5 @@ def bucket_sort(list):
|
|||||||
for bucket in buckets:
|
for bucket in buckets:
|
||||||
sorted_array.extend(bucket)
|
sorted_array.extend(bucket)
|
||||||
|
|
||||||
for i in range(len(lst)):
|
for i in range(len(array)):
|
||||||
lst[i] = sorted_array[i]
|
array[i] = sorted_array[i]
|
||||||
|
Loading…
x
Reference in New Issue
Block a user