Migrate doctest for BucketSort.js

(also remove inline test driver code)

Author: defaude

Sorts/BucketSort.js

@@ -1,25 +1,23 @@
-/*
-[Wikipedia says](https://en.wikipedia.org/wiki/Bucket_sort#:~:text=Bucket%20sort%2C%20or%20bin%20sort,applying%20the%20bucket%20sorting%20algorithm.&text=Sort%20each%20non%2Dempty%20bucket.): Bucket sort, or bin sort, is a sorting algorithm that works by distributing the
-elements of an array into a number of buckets. Each bucket is then sorted individually, either using
-a different sorting algorithm, or by recursively applying the bucket sorting algorithm. It is a
-distribution sort, and is a cousin of radix sort in the most to least significant digit flavour.
-Bucket sort is a generalization of pigeonhole sort. Bucket sort can be implemented with comparisons
-and therefore can also be considered a comparison sort algorithm. The computational complexity estimates
-involve the number of buckets.
-
-Time Complexity of Solution:
-Best Case O(n); Average Case O(n); Worst Case O(n)
-
-*/
-
 /**
- * bucketSort returns an array of numbers sorted in increasing order.
+ * BucketSort implementation.
+ *
+ * Wikipedia says: Bucket sort, or bin sort, is a sorting algorithm that works by distributing the elements of an array
+ * into a number of buckets. Each bucket is then sorted individually, either using a different sorting algorithm, or by
+ * recursively applying the bucket sorting algorithm. It is a distribution sort, and is a cousin of radix sort in the
+ * most to least significant digit flavour. Bucket sort is a generalization of pigeonhole sort. Bucket sort can be
+ * implemented with comparisons and therefore can also be considered a comparison sort algorithm. The computational
+ * complexity estimates involve the number of buckets.
+ *
+ * @see https://en.wikipedia.org/wiki/Bucket_sort#:~:text=Bucket%20sort%2C%20or%20bin%20sort,applying%20the%20bucket%20sorting%20algorithm.&text=Sort%20each%20non%2Dempty%20bucket.
+ *
+ * Time Complexity of Solution:
+ * Best Case O(n); Average Case O(n); Worst Case O(n)
  *
  * @param {number[]} list The array of numbers to be sorted.
  * @param {number} size The size of the buckets used. If not provided, size will be 5.
  * @return {number[]} An array of numbers sorted in increasing order.
  */
-function bucketSort (list, size) {
+export function bucketSort (list, size) {
   if (undefined === size) {
     size = 5
   }
@@ -60,5 +58,3 @@ function bucketSort (list, size) {
   }
   return sorted
 }
-
-export { bucketSort }