Commit c08f93c

committed

fixing

1 parent 6ac6688 commit c08f93cCopy full SHA for c08f93c

File tree

+19

-3

lines changed

+19

-3

lines changed

Lines changed: 6 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -2,6 +2,7 @@`
`2`	`2`
`3`	`3`	`import ir.sk.helper.complexity.SpaceComplexity;`
`4`	`4`	`import ir.sk.helper.complexity.TimeComplexity;`
	`5`	`+import ir.sk.helper.paradigm.DivideAndConquer;`
`5`	`6`	`import ir.sk.helper.paradigm.DynamicProgramming;`
`6`	`7`	`import ir.sk.helper.paradigm.DynamicProgrammingType;`
`7`	`8`
`@@ -22,6 +23,10 @@ public class Algorithms {`
`22`	`23`	`* (1) Only one disk can be moved at a time.`
`23`	`24`	`* (2) A disk is slid off the top of one tower onto another tower.`
`24`	`25`	`* (3) A disk cannot be placed on top of a smaller disk.`
	`26`	`+ *`
	`27`	`+ * T(n):`
	`28`	`+ * 1 n = 1`
	`29`	`+ * 2*T(n-1) + 1 n > 1`
`25`	`30`	`*`
`26`	`31`	`* @param n the number of disks`
`27`	`32`	`* @param src the name of the source rod`
`@@ -30,6 +35,7 @@ public class Algorithms {`
`30`	`35`	`*/`
`31`	`36`	`@TimeComplexity("O(2^n)")`
`32`	`37`	`@SpaceComplexity("O(n)")`
	`38`	`+ @DivideAndConquer`
`33`	`39`	`public static void towerOfHanoi(int n, char src, char buffer, char dest) {`
`34`	`40`	`if (n == 1)`
`35`	`41`	`System.out.println("Disk 1 from " + src + " to " + dest);`

Lines changed: 7 additions & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -4,13 +4,16 @@`
`4`	`4`	`import ir.sk.helper.complexity.SpaceComplexity;`
`5`	`5`	`import ir.sk.helper.complexity.TimeComplexity;`
`6`	`6`	`import ir.sk.helper.paradigm.BruteForce;`
	`7`	`+import ir.sk.helper.paradigm.DivideAndConquer;`
`7`	`8`
`8`	`9`	`import java.math.BigInteger;`
`9`	`10`
`10`	`11`	`/**`
`11`		`- * f(n) =`
`12`		`- * 1 n = 1`
`13`		`- * n * f(n-1) n > 1`
	`12`	`+ * Divide-and-conquer algorithm`
	`13`	`+ *`
	`14`	`+ * T(n) =`
	`15`	`+ * 1 n = 1`
	`16`	`+ * n * T(n-1) n > 1`
`14`	`17`	`*`
`15`	`18`	`* @author <a href="kayvanfar.sj@gmail.com">Saeed Kayvanfar</a> on 1/31/2020.`
`16`	`19`	`*/`
`@@ -27,6 +30,7 @@ public class Factorial {`
`27`	`30`	`@RecurrenceRelation("T(n) = T(n-1) + O(1)")`
`28`	`31`	`@TimeComplexity("O(n)")`
`29`	`32`	`@SpaceComplexity("O(n)")`
	`33`	`+ @DivideAndConquer`
`30`	`34`	`public static int factorialByRecursive(int n) {`
`31`	`35`	`if (n == 0)`
`32`	`36`	`return 1;`

Lines changed: 6 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -3,10 +3,15 @@`
`3`	`3`	`import ir.sk.helper.complexity.SpaceComplexity;`
`4`	`4`	`import ir.sk.helper.complexity.TimeComplexity;`
`5`	`5`	`import ir.sk.helper.paradigm.BruteForce;`
	`6`	`+import ir.sk.helper.paradigm.DivideAndConquer;`
`6`	`7`	`import ir.sk.helper.paradigm.DynamicProgramming;`
`7`	`8`	`import ir.sk.helper.paradigm.DynamicProgrammingType;`
`8`	`9`
`9`	`10`	`/**`
	`11`	`+ * Divide-and-conquer algorithm`
	`12`	`+ * T(n)=`
	`13`	`+ * 1 n = 1, n = 2`
	`14`	`+ * T(n-1) + T(n-2)`
`10`	`15`	`* Created by sad.keyvanfar on 6/25/2020.`
`11`	`16`	`*/`
`12`	`17`	`public class Fibonacci {`
`@@ -20,6 +25,7 @@ public class Fibonacci {`
`20`	`25`	`@BruteForce`
`21`	`26`	`@TimeComplexity("T(n-1) + T(n-2) which is exponential. t(n) = 2 ^ (n/2). O(2^n) exponential. O(branches ^ depth)")`
`22`	`27`	`@SpaceComplexity(" O(n) if we consider the function call stack size, otherwise O(1)")`
	`28`	`+ @DivideAndConquer`
`23`	`29`	`public static long naiveFibonacciByRecursive(long n) {`
`24`	`30`	`if (n == 0 \|\| n == 1)`
`25`	`31`	`return n;`

Comments

(0)