GV

GeezerVison

The World Wide Web, restored to 800 pixels of glory.

Home|About|Gaming cabinet|Archives|How it works|Starter sites

On this site

  • Sign in
  • ActionsCI/CD and automation
  • CodespacesCloud development environments
  • All Features
  • Documentation
  • Training
  • Certifications
  • Build with Copilot
  • Customize Copilot
  • Integrations
  • Trending repos
  • GitHub Sponsors
  • Developer articles
  • Enterprises

This view

  • Original page
  • New address

GeezerVison is showing github.com — Implemented bucket sort · Womol/AlgorithmVisualizer@eb49d9e

File tree

Expand file treeCollapse file tree
Open diff view settings
Filter options
  • algorithm
    • category.json
    • sorting/bucket
      • basic
        • code.js
        • data.js
      • desc.json
Expand file treeCollapse file tree
Open diff view settings
Collapse file

‎algorithm/category.json‎

Copy file name to clipboardExpand all lines: algorithm/category.json
+1Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -69,6 +69,7 @@
6969
},
7070
"sorting": {
7171
"list": {
72+
"bucket": "Bucket Sort",
7273
"bubble": "Bubble Sort",
7374
"comb": "Comb Sort",
7475
"counting": "Counting Sort",
Collapse file

‎algorithm/sorting/bucket/basic/code.js‎

Copy file name to clipboard
+34Lines changed: 34 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,34 @@
1+
//place numbers into appropriate buckets
2+
for (let i = 0; i < array.length; i++) {
3+
var bucketPos = Math.floor(numBuckets * (array[i] / maxValue));
4+
buckets[bucketPos].push(array[i]);
5+
bucketsCount[bucketPos]++;
6+
tracer._select(0, i)._wait();
7+
tracer._notify(1, bucketPos, D[1][bucketPos])._wait();
8+
tracer._deselect(0, i);
9+
tracer._denotify(1, bucketPos, D[1][bucketPos]);
10+
}
11+
12+
var sortLocation = 0;
13+
for (let k = 0; k < buckets.length; k++) {
14+
//do insertion sort
15+
for (let i = 1; i < buckets[k].length; i++) {
16+
var key = buckets[k][i];
17+
var j;
18+
for (j = i - 1; (j >= 0) && (buckets[k][j] > key); j--) {
19+
buckets[k][j + 1] = buckets[k][j];
20+
}
21+
buckets[k][j + 1] = key;
22+
}
23+
24+
//place ordered buckets into sorted array
25+
for (let i = 0; i < buckets[k].length; i++) {
26+
sortedArray[sortLocation] = buckets[k][i];
27+
bucketsCount[k]--;
28+
tracer._notify(1, k, D[1][k]);
29+
tracer._notify(2, sortLocation, D[2][sortLocation])._wait();
30+
tracer._denotify(1, k, D[1][k]);
31+
tracer._denotify(2, sortLocation, D[2][sortLocation]);
32+
sortLocation++;
33+
}
34+
}
Collapse file

‎algorithm/sorting/bucket/basic/data.js‎

Copy file name to clipboard
+24Lines changed: 24 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,24 @@
1+
var maxValue = 100;
2+
var arraySize = 10;
3+
var numBuckets = 5;
4+
5+
//initialize array values
6+
var array = Array1D.random(arraySize, 0, maxValue - 1);
7+
var buckets = [];
8+
var bucketsCount = [];
9+
var sortedArray = [];
10+
for (let i = 0; i < arraySize; i++) {
11+
if (i < numBuckets) {
12+
buckets[i] = [];
13+
bucketsCount[i] = 0;
14+
}
15+
sortedArray[i] = 0;
16+
}
17+
var D = [
18+
array,
19+
bucketsCount,
20+
sortedArray
21+
];
22+
23+
var tracer = new Array2DTracer();
24+
tracer._setData(D);
Collapse file

‎algorithm/sorting/bucket/desc.json‎

Copy file name to clipboard
+13Lines changed: 13 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,13 @@
1+
{
2+
"Bucket Sort": "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.",
3+
"Complexity": {
4+
"time": "worst O(n<sup>2</sup>), best O(n+k), average O(n+k) where n is the number of buckets and k is the range of the input",
5+
"space": "worst O(n*k)"
6+
},
7+
"References": [
8+
"<a href='https://en.wikipedia.org/wiki/Bucket_sort'>Wikipedia</a>"
9+
],
10+
"files": {
11+
"basic": "Bucket sort"
12+
}
13+
}

0 commit comments

Comments
0 (0)
You are visitor 01402520 — GeezerVison does not store the pages you look up.
Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required.