Merge pull request kelvins#48 from ViniciusAlberkovics/master

[JS] HeapSort, Fibonacci and readme

Author: kelvins

README.md

@@ -21,7 +21,7 @@ Com o objetivo de alcançar uma abrangência maior e encorajar novas pessoas a c
 | [Exponenciação Recursiva][14]             | [C/C++](/src/c/ExponenciacaoRecursiva.c) | Java | [Python](/src/python/exponenciacao_recursiva.py) | Go | [Ruby](/src/ruby/ExponenciacaoRecursiva.rb) | [Javascript](/src/javascript/ExponentiationRecursive.js) |  Pascal |
 | [Fatorial][15]                            | [C/C++](/src/c/Fatorial.c) | [Java](/src/java/Fatorial.java) | [Python](/src/python/fatorial.py) | [Go](/src/go/fatorial/fatorial.go) | [Ruby](/src/ruby/Fatorial.rb) | [Javascript](/src/javascript/Factorial.js) |  [Pascal](/src/pascal/fatorial.py) |
 | [Fatorial Recursiva][16]                  | [C/C++](/src/c/FatorialRecursiva.c) | [Java](/src/java/FatorialRecursiva.java) | [Python](/src/python/fatorial_recursiva.py) | Go | [Ruby](/src/ruby/Fatorial.rb) | [Javascript](/src/javascript/FactorialRecursive.js) | [Pascal](src/pascal/fatorial-recusiva.pas) |
-| [Fibonacci][17]                           | [C/C++](/src/c/Fibonacci.cpp) | [Java](/src/java/Fibonacci.java) | [Python](/src/python/fibonacci.py) | [Go](/src/go/fibonacci/fibonacci.go) | [Ruby](/src/ruby/Fibonacci.rb) | Javascript | Pascal |
+| [Fibonacci][17]                           | [C/C++](/src/c/Fibonacci.cpp) | [Java](/src/java/Fibonacci.java) | [Python](/src/python/fibonacci.py) | [Go](/src/go/fibonacci/fibonacci.go) | [Ruby](/src/ruby/Fibonacci.rb) | [Javascript](/src/javascript/Fibonacci.js) | Pascal |
 | [Máximo Recursivo][26]                    | [C/C++](/src/c/MaxRecursivo.c) | Java | Python | Go | Ruby | [Javascript](/src/javascript/MaxRecursive.js) |  Pascal |
 | [Mínimo e Máximo Iterativo][27]           | C/C++ | [Java](/src/java/MaxMinArray.java) | [Python](/src/python/min_max_iterativo.py) | Go | Ruby | [Javascript](/src/javascript/IterativeMinAndMax.js) | Pascal |
 | [Mínimo e Máximo Recursivo][28]           | [C/C++](/src/c/MaxMinRecursivo.c) | Java | [Python](/src/python/maximo_minimo_recursivo.py) | [Go](/src/go/maximominimo/MaximoMinimo.go) | Ruby | [Javascript](/src/javascript/RecursiveMinAndMax.js) | Pascal |
@@ -55,7 +55,7 @@ Com o objetivo de alcançar uma abrangência maior e encorajar novas pessoas a c
 | [Comb Sort][38]                           | C/C++ | Java | Python | [Go](/src/go/combsort/combsort.go) | Ruby | [Javascript](/src/javascript/CombSort.js) | Pascal |
 | [Counting Sort][39]                       | C/C++ | Java | Python | [Go](/src/go/countingsort/countingsort.go) | [Ruby](/src/ruby/count_sort.rb) | Javascript | Pascal |
 | [Gnome Sort][40]                          | C/C++ | Java | Python | [Go](/src/go/gnomesort/gnomesort.go) | Ruby | Javascript |  Pascal |
-| [Heapsort][41]                            | C/C++ | [Java](/src/java/HeapSort.java) | Python | [Go](/src/go/heapsort/heap_sort.go) | [Ruby](/src/ruby/heap_sort.rb) | Javascript | [Pascal](/src/pascal/heapsort.pas) |
+| [Heapsort][41]                            | C/C++ | [Java](/src/java/HeapSort.java) | Python | [Go](/src/go/heapsort/heap_sort.go) | [Ruby](/src/ruby/heap_sort.rb) | [Javascript](/src/javascript/HeapSort.js) | [Pascal](/src/pascal/heapsort.pas) |
 | [Insertion Sort][42]                      | [C/C++](/src/c/InsertionSort.cpp) | [Java](/src/java/InsertionSort.java) | [Python](/src/python/insertion_sort_iterativo.py) | [Go](/src/go/insertionsort/insertionsort.go) | [Ruby](/src/ruby/insertion_sort.rb) | [Javascript](/src/javascript/InsertionSort.js) |  Pascal |
 | 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) |

src/javascript/Fibonacci.js

@@ -0,0 +1,13 @@
+/**
+ * 
+ * @param {number} n 
+ */
+function fibonacci(n) {
+  return n < 2 ? n : (fibonacci(n - 1) + fibonacci(n - 2));
+}
+
+function main(){
+  console.log('fibonacci 30 -> ', fibonacci(30))
+}
+
+main();

src/javascript/HeapSort.js

@@ -0,0 +1,57 @@
+const MAX_LENGTH = 10;
+
+/**
+ * @param {number[]} vector 
+ */
+function heapSort(vector){
+    let length = vector.length;
+    let i = parseInt(vector.length / 2);
+    let temp, father, children;
+
+    while(true) {
+        if(i > 0){
+            i--;
+            temp = vector[i];
+        } else {
+            length--;
+            if (length <= 0) return vector;
+
+            temp = vector[length];
+            vector[length] = vector[0];
+        }
+
+        father = i;
+        children = parseInt((i * 2) + 1);
+
+        while(children < length) {
+            if (children + 1 < length && vector[children + 1] > vector[children])
+                children++;
+
+            if (vector[children] > temp) {
+                vector[father] = vector[children];
+                father = children;
+                children = parseInt(father * 2 + 1);
+            } else break;
+        }
+
+        vector[father] = temp;
+    }
+}
+
+function main(){
+    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("Initial -> ", values);
+
+    console.log("Final Vector")
+    console.table(heapSort(vector));
+}
+
+main();