Bucket Sort Problem

Amazon Development Center U.S. needs to order integer processing-time measurements before generating an operational report. Implement bucket sort to return the measurements in nondecreasing order without calling Python's built-in sorting functions.

Given an array times of integers and a positive integer bucket_count, create that many buckets spanning the input's minimum and maximum values. Distribute each value into its bucket, sort each bucket using insertion sort, and concatenate the buckets in order. The algorithm must support negative values and duplicate values.

Formal Specification

• Input: times, a list of integers, and bucket_count, a positive integer.
• Output: A new list containing all values from times in nondecreasing order.
• Do not modify the input list.
• If times is empty, return an empty list.