Commit8dbb475

committed

session 03

1 parent27a2908 commit8dbb475Copy full SHA for 8dbb475

File tree

+92

-3

lines changed

+92

-3

lines changed

Lines changed: 2 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -3,5 +3,5 @@ var __importDefault = (this && this.__importDefault) \|\| function (mod) {`
`3`	`3`	`return(mod&&mod.__esModule) ?mod :{"default":mod};`
`4`	`4`	`};`
`5`	`5`	`Object.defineProperty(exports,"__esModule",{value:true});`
`6`		`-consttask_a02_1=__importDefault(require("./task-a02"));`
`7`		`-exports.default=task_a02_1.default;`
	`6`	`+consttask_a03_1=__importDefault(require("./task-a03"));`
	`7`	`+exports.default=task_a03_1.default;`

Lines changed: 42 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,42 @@`
	`1`	`+"use strict";`
	`2`	`+// 6! = 6 * 5 * 4 * 3 * 2 * 1`
	`3`	`+Object.defineProperty(exports,"__esModule",{value:true});`
	`4`	`+functionfact(n){`
	`5`	`+letp=1;`
	`6`	`+for(leti=1;i<=n;i++){`
	`7`	`+p*=i;`
	`8`	`+}`
	`9`	`+returnp;`
	`10`	`+}`
	`11`	`+functionfactRecursive(n){`
	`12`	`+//if (n == 1 \|\| n == 0) return 1;`
	`13`	`+//else return n * factRecursive(n - 1);`
	`14`	`+returnn==1\|\|n==0 ?1 :n*factRecursive(n-1);`
	`15`	`+}`
	`16`	`+// f1 = 1, f2 = 1, f3 = f1 + f2, f4 = f3 + f2, ....`
	`17`	`+functionfibonacci(n){`
	`18`	`+letf1=1;`
	`19`	`+letf2=1;`
	`20`	`+letfn=0;`
	`21`	`+for(leti=0;i<n;i++){`
	`22`	`+fn=f1+f2;`
	`23`	`+f1=f2;`
	`24`	`+f2=fn;`
	`25`	`+}`
	`26`	`+returnfn;`
	`27`	`+}`
	`28`	`+functionfibonacciRec(n){`
	`29`	`+if(n<2)`
	`30`	`+returnn;`
	`31`	`+returnfibonacciRec(n-1)+fibonacciRec(n-2);`
	`32`	`+}`
	`33`	`+functionrun(){`
	`34`	`+console.log('Task a03');`
	`35`	`+console.time('Fibonacci');`
	`36`	`+console.log(fibonacci(5));`
	`37`	`+console.timeEnd('Fibonacci');`
	`38`	`+console.time('Fib REC');`
	`39`	`+console.log(fibonacciRec(7));`
	`40`	`+console.timeEnd('Fib REC');`
	`41`	`+}`
	`42`	`+exports.default=run;`

Lines changed: 2 additions & 1 deletion

Lines changed: 46 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,46 @@`
	`1`	`+// 6! = 6 * 5 * 4 * 3 * 2 * 1`
	`2`	`+`
	`3`	`+functionfact(n:number):number{`
	`4`	`+letp=1;`
	`5`	`+for(leti=1;i<=n;i++){`
	`6`	`+p*=i;`
	`7`	`+}`
	`8`	`+returnp;`
	`9`	`+}`
	`10`	`+`
	`11`	`+functionfactRecursive(n:number):number{`
	`12`	`+//if (n == 1 \|\| n == 0) return 1;`
	`13`	`+//else return n * factRecursive(n - 1);`
	`14`	`+returnn==1\|\|n==0 ?1 :n*factRecursive(n-1);`
	`15`	`+}`
	`16`	`+`
	`17`	`+// f1 = 1, f2 = 1, f3 = f1 + f2, f4 = f3 + f2, ....`
	`18`	`+`
	`19`	`+functionfibonacci(n:number):number{`
	`20`	`+letf1=1;`
	`21`	`+letf2=1;`
	`22`	`+letfn=0;`
	`23`	`+for(leti=0;i<n;i++){`
	`24`	`+fn=f1+f2;`
	`25`	`+f1=f2;`
	`26`	`+f2=fn;`
	`27`	`+}`
	`28`	`+returnfn;`
	`29`	`+}`
	`30`	`+`
	`31`	`+functionfibonacciRec(n:number):number{`
	`32`	`+if(n<2)returnn;`
	`33`	`+returnfibonacciRec(n-1)+fibonacciRec(n-2);`
	`34`	`+}`
	`35`	`+`
	`36`	`+functionrun():void{`
	`37`	`+console.log('Task a03');`
	`38`	`+console.time('Fibonacci');`
	`39`	`+console.log(fibonacci(5));`
	`40`	`+console.timeEnd('Fibonacci');`
	`41`	`+console.time('Fib REC');`
	`42`	`+console.log(fibonacciRec(7));`
	`43`	`+console.timeEnd('Fib REC');`
	`44`	`+}`
	`45`	`+`
	`46`	`+exportdefaultrun;`

Comments

(0)