added chapter 11

loiane · loiane · commit 7db601d32b05 · 2014-09-01T12:44:49.000-03:00
diff --git a/chapter11/01-Recursion.html b/chapter11/01-Recursion.html
@@ -5,6 +5,6 @@
     <title></title>
 </head>
 <body>
-<script type="text/javascript" src="BigONotation.js"></script>
+<script type="text/javascript" src="01-Recursion.js"></script>
 </body>
 </html>
diff --git a/chapter11/01-Recursion.js b/chapter11/01-Recursion.js
@@ -1,3 +1,4 @@
+//Recursive solution - DP
 function fibonacci(num){
     if (num === 1 || num === 2){
         return 1;
@@ -7,6 +8,7 @@ function fibonacci(num){
     }
 }
 
+//Non Recursive solution
 function fib(num){
     var n1 = 1,
         n2 = 1,
@@ -17,4 +19,7 @@ function fib(num){
         n2 = n;
     }
     return n;
-}
+}
+
+console.log(fibonacci(6));
+console.log(fib(6));
diff --git a/chapter11/03-MinCoinChangeGreedy.html b/chapter11/03-MinCoinChangeGreedy.html
@@ -0,0 +1,10 @@
+<!DOCTYPE html>
+<html>
+<head>
+    <meta charset="UTF-8">
+    <title></title>
+</head>
+<body>
+<script type="text/javascript" src="03-MinCoinChangeGreedy.js"></script>
+</body>
+</html>
diff --git a/chapter11/03-MinCoinChangeGreedy.js b/chapter11/03-MinCoinChangeGreedy.js
diff --git a/chapter11/04-BigONotation.html b/chapter11/04-BigONotation.html
@@ -5,6 +5,6 @@
     <title></title>
 </head>
 <body>
-<script type="text/javascript" src="MinCoinChangeGreedy.js"></script>
+<script type="text/javascript" src="04-BigONotation.js"></script>
 </body>
 </html>
diff --git a/chapter11/04-BigONotation.js b/chapter11/04-BigONotation.js
@@ -10,7 +10,7 @@ increment(2);
 //*************** o(n)
 
 function createNonSortedArray(size){
-    var array = []
+    var array = [];
 
     for (var i = size; i> 0; i--){
         array[i] = i;

Original file line number	Diff line number	Diff line change
`@@ -1,3 +1,4 @@`
	`1`	`+//Recursive solution - DP`
`1`	`2`	`function fibonacci(num){`
`2`	`3`	`if (num === 1 \|\| num === 2){`
`3`	`4`	`return 1;`
`@@ -7,6 +8,7 @@ function fibonacci(num){`
`7`	`8`	`}`
`8`	`9`	`}`
`9`	`10`
	`11`	`+//Non Recursive solution`
`10`	`12`	`function fib(num){`
`11`	`13`	`var n1 = 1,`
`12`	`14`	`n2 = 1,`
`@@ -17,4 +19,7 @@ function fib(num){`
`17`	`19`	`n2 = n;`
`18`	`20`	`}`
`19`	`21`	`return n;`
`20`		`-}`
	`22`	`+}`
	`23`	`+`
	`24`	`+console.log(fibonacci(6));`
	`25`	`+console.log(fib(6));`