Skip to content

Implemented bucket sort #190

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
TornjV merged 1 commit into from
Jun 21, 2016
Merged

Implemented bucket sort #190

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
1 change: 1 addition & 0 deletions algorithm/category.json
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -69,6 +69,7 @@
},
"sorting": {
"list": {
"bucket": "Bucket Sort",
"bubble": "Bubble Sort",
"comb": "Comb Sort",
"counting": "Counting Sort",
Expand Down
34 changes: 34 additions & 0 deletions algorithm/sorting/bucket/basic/code.js
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,34 @@
//place numbers into appropriate buckets
for (let i = 0; i < array.length; i++) {
var bucketPos = Math.floor(numBuckets * (array[i] / maxValue));
buckets[bucketPos].push(array[i]);
bucketsCount[bucketPos]++;
tracer._select(0, i)._wait();
tracer._notify(1, bucketPos, D[1][bucketPos])._wait();
tracer._deselect(0, i);
tracer._denotify(1, bucketPos, D[1][bucketPos]);
}

var sortLocation = 0;
for (let k = 0; k < buckets.length; k++) {
//do insertion sort
for (let i = 1; i < buckets[k].length; i++) {
var key = buckets[k][i];
var j;
for (j = i - 1; (j >= 0) && (buckets[k][j] > key); j--) {
buckets[k][j + 1] = buckets[k][j];
}
buckets[k][j + 1] = key;
}

//place ordered buckets into sorted array
for (let i = 0; i < buckets[k].length; i++) {
sortedArray[sortLocation] = buckets[k][i];
bucketsCount[k]--;
tracer._notify(1, k, D[1][k]);
tracer._notify(2, sortLocation, D[2][sortLocation])._wait();
tracer._denotify(1, k, D[1][k]);
tracer._denotify(2, sortLocation, D[2][sortLocation]);
sortLocation++;
}
}
24 changes: 24 additions & 0 deletions algorithm/sorting/bucket/basic/data.js
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,24 @@
var maxValue = 100;
var arraySize = 10;
var numBuckets = 5;

//initialize array values
var array = Array1D.random(arraySize, 0, maxValue - 1);
var buckets = [];
var bucketsCount = [];
var sortedArray = [];
for (let i = 0; i < arraySize; i++) {
if (i < numBuckets) {
buckets[i] = [];
bucketsCount[i] = 0;
}
sortedArray[i] = 0;
}
var D = [
array,
bucketsCount,
sortedArray
];

var tracer = new Array2DTracer();
tracer._setData(D);
13 changes: 13 additions & 0 deletions algorithm/sorting/bucket/desc.json
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,13 @@
{
"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.",
"Complexity": {
"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",
"space": "worst O(n*k)"
},
"References": [
"<a href='https://en.wikipedia.org/wiki/Bucket_sort'>Wikipedia</a>"
],
"files": {
"basic": "Bucket sort"
}
}