I’m trying to implement the bucket sort algorithm using Python. My current implementation seems to have a problem when dealing with integer values outside the range of 0 to 1. Specifically, the index calculation for bucket placement results in an index that is out of the range of the number of buckets.

this is my code:

`def bucketsort(array):
bucket = []

for i in range (len(array)):
    bucket.append([])

for j in array:
    index_b = int(10*j)
    bucket[index_b].append(j)

for i in range(len(array)):
    bucket[i] = sorted(bucket[i])

k = 0
for i in range(len(array)):
    for j in range(len(bucket[i])):
        array[k] = bucket[i][j]
        k += 1
return array

array = [12, 84, 64, 65, 94, 46, 99]
print(“Sorted array is: “, bucketsort(array))`

When I run this code with the array [12, 84, 64, 65, 94, 46, 99], show an IndexError due to the calculated bucket index being out of range.

How can I modify my implementation to handle a general case of integer arrays?