# 1.sorts method python (4)bucket_sort

https://blog.csdn.net/liaoshengshi/article/details/47320023

my stupid code：需要指定桶个数

# -*- coding: utf-8 -*-
"""
Created on Wed Jul 31 10:14:28 2019

@author: yue zhang

E-mails: yuezh2015@163.com
"""
import numpy as np

def bucket_sort(data,bucket_count):
data_num = len(data)
if data_num <2:
return data

min_value, max_value = min(data),max(data)
print (min_value,max_value)
bucket_size = int(max_value-min_value+1)/bucket_count+1
bucket = [[] for i in range(bucket_count)]

print(bucket)
for i in range(len(data)):
bucket_order = int((data[i]-min_value+1)/bucket_size+1)
bucket[bucket_order-1].append(data[i])
print(bucket)
data_final = []
for i in  range (bucket_count):
data_bucket = bucket[i]
bucket_num = len(data_bucket)
if bucket_num !=0:
data_bucket = bucket_sort(data_bucket,bucket_count)
data_final = data_final + data_bucket

return data_final

if __name__ == '__main__':
#data = [10,20,50,3,5,7,9,11,88,55,77,56,1,2,4,555,19, 25, 26, 29 ,38 ,50 ,80, 91 ,86, 78 ,66 ,46, 32 ,19 ,15 , 7]
data = [ 59, 25,50,3,55,77,56,1,2,4,555,19 ]
bucket_count = 10
data= bucket_sort(data,bucket_count)


#!/usr/bin/env python

"""Illustrate how to implement bucket sort algorithm."""

# Author: OMKAR PATHAK
# This program will illustrate how to implement bucket sort algorithm

# Wikipedia says: Bucket sort, or bin sort, is a sorting algorithm that works
# by distributing the elements of an array into a number of buckets.
# Each bucket is then sorted individually, either using a different sorting
# algorithm, or by recursively applying the bucket sorting algorithm. It is a
# distribution sort, and is a cousin of radix sort in the most to least
# significant digit flavour.
# Bucket sort is a generalization of pigeonhole sort. Bucket sort can be
# implemented with comparisons and therefore can also be considered a
# comparison sort algorithm. The computational complexity estimates involve the
# number of buckets.

#  Time Complexity of Solution:
#  Worst case scenario occurs when all the elements are placed in a single bucket. The overall performance
#  would then be dominated by the algorithm used to sort each bucket. In this case, O(n log n), because of TimSort
#
#  Average Case O(n + (n^2)/k + k), where k is the number of buckets
#
#  If k = O(n), time complexity is O(n)

DEFAULT_BUCKET_SIZE = 5

def bucket_sort(my_list, bucket_size=DEFAULT_BUCKET_SIZE):
if len(my_list) == 0:

min_value, max_value = (min(my_list), max(my_list))
bucket_count = ((max_value - min_value) // bucket_size + 1)
buckets = [[] for _ in range(int(bucket_count))]

for i in range(len(my_list)):
buckets[int((my_list[i] - min_value) // bucket_size)
].append(my_list[i])

return sorted([buckets[i][j] for i in range(len(buckets))
for j in range(len(buckets[i]))])

if __name__ == "__main__":
user_input = input('Enter numbers separated by a comma:').strip()
unsorted = [float(n) for n in user_input.split(',') if len(user_input) > 0]
print(bucket_sort(unsorted))

©️2019 CSDN 皮肤主题: 大白 设计师: CSDN官方博客