Изменения

Bucketsort (array,min_element,max_element) if (array.length < 2 || min_element == max_element ) return array; initialize buckets <- new array of n empty lists initialize buckets_minimum initialize buckets_maximum for i = 0 to array.length - 1 index = int(array[i] * num_buckets / range) insert array[i] at end buckets[index] buckets_minimum[i] = minimum ( buckets[index], arra[i]) buckets_maximum[i] = maximum ( buckets[index], arra[i]) for i = 0 to num_buckets - 1 buckets[i] = Bucketsort (buckets[i],min_bucktes[i],max_buckets[i]) intialize answer for i = 0 to buckets_num - 1 for k = 0 to buckets[i].length - 1 insert buckets[i][k] аt end answer return answer