BucketSort for integer

# -*- coding: utf-8 -*-
"""
Created on Sat Dec  8 13:38:43 2018

@author: micha
"""

A=[]
from random import randint
for i in range(0,100):
    A.append(randint(1,100))

print(A)
print()


B=[0]*(len(A)+1)

def BucketSort(A):
    n=len(A)

    for i in (A):
       B[i]+=1     #zlicza ile jest tych samych liczb i zapisuje je do elementu o odpowiednim indeksie


    j=0
    for i in range(n+1):
        while(B[i]>0):
            A[j]= i
            B[i]-=1
            j+=1

BucketSort(A)
print(A)