recursion

src/getElementsByClassName.js

@@ -6,6 +6,29 @@
 // But instead we're going to implement it from scratch:
 
 
-var getElementsByClassName = function(className) {
-  // Your code here
-};
+
+  var getElementsByClassName = function(className) {
+    var results = [];
+    var checkNodes = function(node) {
+      // If the element contains the class className
+      if (node.classList && node.classList.contains(className)) {
+        // Add it to our result
+        results.push(node);
+      }
+
+      // If the element contains child nodes
+      if (node.childNodes) {
+        // Loop through each child node
+        for (var i = 0; i < node.childNodes.length; i++){
+        checkNodes(node.childNodes[i])
+        }
+        // _.each(element.childNodes, function(item) {
+        //   // Recursively call findElementsContainingClass until we've looped through all child nodes
+        //   findElementsContainingClass(item);
+        // });
+      }
+    }
+    // Start our recursive function
+    checkNodes(document.body);
+    return results
+  }

src/nthFibonacci.js

@@ -17,6 +17,10 @@
 // etc...
 
 var nthFibonacci = function(n) {
+  if(n<2){
+    return n
+  }
+  else return( nthFibonacci(n-1)+ nthFibonacci(n-2))
   // Your code here
 };
 

src/power.js

@@ -13,5 +13,8 @@
 // power(10, 3) => 1000
 
 var power = function(base, exponent) {
-  // Your code here
+  if (exponent===0)
+  return 1
+   else 
+   return base*power(base,exponent-1)
 };

src/sumArray.js

@@ -16,6 +16,13 @@
 // sumArray([1, 2, 3, 4, 5]) => 15
 
 
-var sumArray = function(arr) {
-  // Your code here
-};
+var sumArray = function(arr){
+ var result =0
+    if (arr.length == 0)
+        return 0;
+    else
+      return   result=+ arr.shift() + sumArray(arr.slice());
+
+}
+
+