answersLogoWhite

0

There is no best, worst or average case running time for bucket sort. We must assume that the number of elements in the list is comparable to the possible number of values in the list. Making it O(n).

Correct me if I am wrong but if the values in the list are already sorted or close to being already sorted it would be O(n lg n).

User Avatar

Wiki User

16y ago

What else can I help you with?