Radix Sort and readme

Author: ViniciusAlberkovics

README.md

@@ -60,7 +60,7 @@ Com o objetivo de alcançar uma abrangência maior e encorajar novas pessoas a c
 | Insertion Sort Recursivo            | C/C++ | Java | [Python](/src/python/insertion_sort_recursivo.py) | Go | Ruby | Javascript |  Pascal |
 | [Merge Sort][44]                          | [C/C++](/src/c/MergeSort.c) | [Java](/src/java/Mergesort.java) | Python | [Go](/src/go/mergesort/mergesort.go) | [Ruby](/src/ruby/merge_sort.rb) | [Javascript](/src/javascript/MergeSort.js) | [Pascal](/src/pascal/sort/mergesort.pas) |
 | [Quicksort][45]                           | [C/C++](/src/c/QuickSort.cpp) | [Java](/src/java/Quicksort.java) | [Python](/src/python/quick_sort.py) | [Go](/src/go/quicksort/quicksort.go) | [Ruby](/src/ruby/quick_sort.rb) | [Javascript](/src/javascript/QuickSort.js) |  Pascal |
-| [Radix Sort][46]                          | C/C++ | [Java](/src/java/RadixSort.java) | Python | [Go](/src/go/radixsort/radixsort.go) | [Ruby](/src/ruby/radix_sort.rb) | Javascript | Pascal |
+| [Radix Sort][46]                          | C/C++ | [Java](/src/java/RadixSort.java) | Python | [Go](/src/go/radixsort/radixsort.go) | [Ruby](/src/ruby/radix_sort.rb) | [Javascript](/src/javascript/RadixSort.js) | Pascal |
 | [Selection Sort][47]                      | [C/C++](/src/c/SelectionSort.cpp) | [Java](/src/java/SelectionSort.java) | [Python](/src/python/selection_sort.py) | [Go](/src/go/selectionsort/selectionsort.go) | [Ruby](/src/ruby/selection_sort.rb) | [Javascript](/src/javascript/SelectionSort.js) | [Pascal](/src/pascal/selectsort.pas) |
 | [Shell Sort][48]                          | C/C++ | [Java](/src/java/ShellSort.java) | [Python](/src/python/shell_sort.py) | [Go](/src/go/shellsort/shellsort.go) | Ruby | [Javascript](/src/javascript/ShellSort.js) |  Pascal |
 | [Timsort][53]                             | C/C++ | Java | [Python](/src/python/tim_sort.py) | Go | Ruby | Javascript | Pascal |

src/javascript/RadixSort.js

@@ -0,0 +1,51 @@
+/**
+ * @param {number[]} vector 
+ */
+function RadixSort(vector) {
+    let i = 0;
+    let b = new Int32Array(vector.length);
+    let bigger = vector[0];
+    let exp = 1;
+
+    for (i = 0; i < vector.length; i++) {
+        if (vector[i] > bigger)
+            bigger = vector[i];
+    }
+
+    while(parseInt(bigger / exp) > 0){
+        let bucket = new Int32Array(10);
+
+        for (i = 0; i < vector.length; i++)
+            bucket[parseInt(parseInt((vector[i] / exp)) % 10)]++;
+        for (i = 1; i < 10; i++)
+            bucket[i] += bucket[i - 1];
+        for (i = vector.length - 1; i >= 0; i--)
+            b[--bucket[parseInt(parseInt((vector[i] / exp)) % 10)]] = vector[i];
+        for (i = 0; i < vector.length; i++)
+            vector[i] = b[i];
+        
+        exp *= 10;
+    }
+}
+
+function main() {
+    const MAX_LENGTH = 20;
+    let vector = [];
+    let values = "[";
+    for (let index = 0; index < MAX_LENGTH; index++) {
+        let value = Math.floor(Math.random() * 99);  // 0 - 99
+        vector.push(value);
+        values += `${value}, `;
+    }
+    values += "]";
+
+    console.log(values);
+
+    RadixSort(vector);
+    values = "[";
+    vector.forEach(v => values+=`${v}, `);
+    values += "]";
+    console.log(values);
+}
+
+main();