//Bucket Sort best: O(n+m) avg: Θ(n+m) worst:O(n2)
//Where N is numbers and M is buckets
//TIME = O(n), if m<n if bucket count is smaller than number count
//Memory O(N)- buckets increase with N Or The space complexity for Bucket Sort is O(n+k) if buckets +numbers are added as sublist of a bucket
public void ExecuteBucketSort(int[] array)
{
BucketSort.Execute(array);
}