[JS] MaxRecursive and readme

Author: ViniciusAlberkovics

README.md

@@ -22,7 +22,7 @@ Com o objetivo de alcançar uma abrangência maior e encorajar novas pessoas a c
 | [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 |
-| [Máximo Recursivo][26]                    | [C/C++](/src/c/MaxRecursivo.c) | Java | Python | Go | Ruby | Javascript |  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 | 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 | Pascal |
 | Mínimo e Máximo Divisão e Conquista | C/C++ | Java | [Python](/src/python/maximo_recursivo_dc.py) | [Go](/src/go/maximominimo/MaximoMinimo.go) | Ruby | Javascript | Pascal |

src/javascript/MaxRecursive.js

@@ -0,0 +1,62 @@
+/**
+ * Maximum using Division and Conquest
+ * @param {Array<Number>} vector 
+ * @param {number} start 
+ * @param {number} end 
+ */
+function maxDivisionAndConquest(vector, start, end){
+    if (start === end) return vector[start];
+    
+    const middle = parseInt((start + end) / 2);
+
+    const aux1 = maxDivisionAndConquest(vector, start, middle);
+    const aux2 = maxDivisionAndConquest(vector, middle + 1, end);
+
+    if (aux1 > aux2) return aux1;
+    else return aux2;
+}
+
+const MAX_LENGTH = 10;
+
+/**
+ * @param {Array<number>} vector 
+ * @param {number} max 
+ * @param {number} index 
+ */
+function max1(vector, max, index){
+    if (vector[index] > max) max = vector[index];
+    if (index < MAX_LENGTH - 1) max = max1(vector, max, index + 1);
+    
+    return max;
+}
+
+/**
+ * @param {Array<number>} vector 
+ * @param {number} lengthVector 
+ * @returns {number}
+ */
+function max2(vector, lengthVector){
+    if (lengthVector === 1) return vector[0];
+
+    const max = max2(vector, lengthVector - 1);
+    if (max > vector[lengthVector - 1]) return max;
+    else return vector[lengthVector - 1];
+}
+
+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(values);
+    console.log('maxDivisionAndConquest => ', maxDivisionAndConquest(vector, 0, MAX_LENGTH -1));
+    console.log('max1 => ', max1(vector, vector[0], 1));
+    console.log('max2 => ', max2(vector, MAX_LENGTH));
+}
+
+main();