Fixed a bug in the radix sort algorithm, that would sort the indexes of the passed array instead of the actual array items.

Panzki · Panzki · commit a7a192ad0819 · 2017-10-10T12:30:58.000+02:00
diff --git a/Sorts/radixSort.js b/Sorts/radixSort.js
@@ -24,7 +24,7 @@ function radixSort(items, RADIX) {
 
     for (var j = 0; j < items.length; j++) {
       var tmp = items[j] / placement;
-      buckets[Math.round(tmp % RADIX)].push(j);
+      buckets[Math.floor(tmp % RADIX)].push(items[j]);
       if (maxLength && tmp > 0) {
         maxLength = false;
       }
@@ -34,7 +34,7 @@ function radixSort(items, RADIX) {
     for (var b = 0; b < RADIX; b++) {
       var buck = buckets[b];
       for (var k = 0; k < buck.length; k++) {
-        items[a] = k;
+        items[a] = buck[k];
         a++;
       }
     }

Original file line number	Diff line number	Diff line change
`@@ -24,7 +24,7 @@ function radixSort(items, RADIX) {`
`24`	`24`
`25`	`25`	`for (var j = 0; j < items.length; j++) {`
`26`	`26`	`var tmp = items[j] / placement;`
`27`		`- buckets[Math.round(tmp % RADIX)].push(j);`
	`27`	`+ buckets[Math.floor(tmp % RADIX)].push(items[j]);`
`28`	`28`	`if (maxLength && tmp > 0) {`
`29`	`29`	`maxLength = false;`
`30`	`30`	`}`
`@@ -34,7 +34,7 @@ function radixSort(items, RADIX) {`
`34`	`34`	`for (var b = 0; b < RADIX; b++) {`
`35`	`35`	`var buck = buckets[b];`
`36`	`36`	`for (var k = 0; k < buck.length; k++) {`
`37`		`- items[a] = k;`
	`37`	`+ items[a] = buck[k];`
`38`	`38`	`a++;`
`39`	`39`	`}`
`40`	`40`	`}`