Changes?

Author: bpquigley

module-7-programming-assignment.html

@@ -24,7 +24,16 @@
 
 // 1. Implement fibonnacci using a recursive function and test your code.
 
+function fibonacci(num) {
+  if (num == 1)
+    return 0;
+  if (num == 2)
+    return 1;
+  return fibonacci(num - 1) + fibonacci(num - 2);
+}
 
+console.log("Fibonacci of 5 is: " +fibonacci(5));
+console.log("Fibonacci of 13 is: " +fibonacci(13));
 
 //---------------------//
 // Dynamic programming //
@@ -34,7 +43,40 @@
 // 1. Implement the minimum coin change problem using dynamic programming.
 //    Test your code.
 
-
+function MinCoinChange(coins) {
+  var coins = coins;
+  var cache = {};
+
+  this.makeChange = function(amount) {
+    var me = this;
+    if (!amount) {
+      return [];
+    }
+    if (cache[amount]) {
+      return cache[amount];
+    }
+    var min = [], newMin, newAmount;
+    for (var i=0; i<coins.length; i++) {
+      var coin = coins[i];
+      newAmount = amount - coin;
+      if (newAmount >= 0) {
+        newMin = me.makeChange(newAmount);
+      }
+      if (
+        newAmount >= 0 &&
+        (newMin.length < min.length - 1 || !min.length)
+        && (newMin.length || !newAmount))
+        {
+          min = [coin].concat(newMin);
+          console.log('new Min ' + min + ' for ' + amount);
+        }
+    }
+    return (cache[amount] = min);
+  };
+}
+
+var minCoinChange = new MinCoinChange([1, 5, 10, 25]);
+console.log(minCoinChange.makeChange(36));
 
 //-------------------//
 // Greedy algorithms //
@@ -44,6 +86,24 @@
 // 1. Implement the minimum coin change problem using a greedy algorithm.
 //    Test your code.
 
+function minCoinChange(coins) {
+  var coins = coins;
+
+  this.makeChange = function(amount) {
+    var change = [];
+    total = 0;
+    for (var i=coins.length; i>=0; i--) {
+      var coin = coins[i];
+      while (total + coinm <- amount) {
+        change.push(coin);
+        total += coin;
+      }
+    }
+    return change;
+  };
+}
+var minCoinChange = new MinCoinChange([1, 5, 10, 25]);
+console.log(minCoinChange.makeChange(36));
 
 
 //----------------------------------------//
@@ -54,9 +114,39 @@
 // 1. Solve the problem of obtaining all the positive numbers in an array using
 //    imperative style.
 
+var printPosNums = funtion(array) {
+  for (var i=0; i<array.length; i++) {
+    if (array[i] >= 0) {
+      console.log(array[i]);
+    }
+  }
+}
+
+let newNumsArray = [-4, -5, 4, 8, -1, 0, 13];
+
+printPosNums(newNumsArray);
+
 // 2. Solve the problem of obtaining all the positive numbers in an array using
 //    functional style.
 
+var forEach = function(array, action) {
+  let array = array;
+
+  for (var i = 0; i<array.length; i++) {
+    if (isPos(array[i])) {
+      console.log("The value is " + array[i]);
+
+    }
+  }
+
+  this.isPos(num) {
+    if (num > 0) {
+      return true;
+   }
+ }
+
+
+}
 
 
 </script>

module-7-programming-project.html

@@ -24,24 +24,61 @@
 
 // 1. Implement factorial using a recursive function and test your code.
 
+function factorial(num){
+  return factorial((num - 1) * num);
+}
+
+
+console.log(factorial(12));
+
 // 2. Implement a function that returns the complete fibonacci sequence in an
 //    array for a given number.
 
+function fibSeq(num) {
+  fibArray = [];
+  fibArray = fibSeq(num - 1) + (num - 2);
+
+  return fibArray;
+}
+
 // 3. Implement finding the longest common subsequence using dynamic
 //    programming. Test your code.
 
+
+
 // 4. Solve the problem of summing all the numbers in an array using
 //    imperative style.
 
+var sumArray = function(array) {
+  let sum = 0;
+
+  for (var i=0; i<array.length; i++) {
+    sum = sum + array[i];
+  }
+
+return sum;
+}
+
+let impArray = sumArray([3, 5, 6, 10, 8]);
+console.log("The sum is " + impArray);
+
+
+
 // 5. Solve the problem of summing all the numbers in an array using
 //    functional style.
 
+
+
+
+
 // 6. Solve problem 14 of Project Euler: https://projecteuler.net/problem=14
 //    Note: This may be a bit challenging. Try to get as far as you can.
 //          Instead of one million you could use a smaller number for testing.
 
 
 
+
+
 </script>
 </head>
 <body>

module-8-programming-assignment.html

@@ -34,11 +34,15 @@
   return true;
 }
 
+
+
 // 2. Write a program that finds the minimum element in a stack in O(1) time
 //    complexity. Note that earlier solutions searched through the elements on
 //    the stack but that leads to an O(n) solution.
 //    NOTE: this question is sometimes asked on interviews.
 
+//reorder the stack
+//split stack in half
 
 
 //----------------------------//
@@ -48,6 +52,9 @@
 
 // 1. Solve Project Euler problem 1 (https://projecteuler.net/problem=1).
 
+
+
+
 // 2. Solve Project Euler problem 2 (https://projecteuler.net/problem=2).