42
правки
Изменения
Нет описания правки
index = int(array[i] * num_buckets / range)
insert array[i] at end buckets[index]
buckets_minimum[i] = minimum ( buckets[index], arraarray[i]) buckets_maximum[i] = maximum ( buckets[index], arraarray[i])
for i = 0 to num_buckets - 1
buckets[i] = quicksort (buckets[i],min_bucktes[i],max_buckets[i])
