We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 754f7b6 commit 2691756Copy full SHA for 2691756
Sorts/BucketSort.js
@@ -11,6 +11,14 @@ Time Complexity of Solution:
11
Best Case O(n); Average Case O(n); Worst Case O(n)
12
13
*/
14
+
15
+/**
16
+ * bucketSort returns an array of numbers sorted in increasing order.
17
+ *
18
+ * @param {number[]} list The array of numbers to be sorted.
19
+ * @param {number} size The size of the buckets used. If not provided, size will be 5.
20
+ * @return {number[]} An array of numbers sorted in increasing order.
21
+*/
22
function bucketSort (list, size) {
23
if (undefined === size) {
24
size = 5
0 commit comments