package Sorts;

import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.Random;

/** Wikipedia: https://en.wikipedia.org/wiki/Bucket_sort */
public class BucketSort {
  public static void main(String[] args) {
    int[] arr = new int[10];

    /* generate 10 random numbers from -50 to 49 */
    Random random = new Random();
    for (int i = 0; i < arr.length; ++i) {
      arr[i] = random.nextInt(100) - 50;
    }

    bucketSort(arr);

    /* check array is sorted or not */
    for (int i = 0, limit = arr.length - 1; i < limit; ++i) {
      assert arr[i]  max) {
        max = value;
      }
    }
    return max;
  }

  /**
   * Calculate min value of array
   *
   * @param arr the array contains elements
   * @return min value of given array
   */
  public static int min(int[] arr) {
    int min = arr[0];
    for (int value : arr) {
      if (value < min) {
        min = value;
      }
    }
    return min;
  }
}