Commit 11c14ad

author

Mansour Torabi

committed

Grid Path Count Example Added

1 parent bd8ec49 commit 11c14adCopy full SHA for 11c14ad

File tree

-3

lines changed

-3

lines changed

Lines changed: 3 additions & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,8 +1,8 @@`
`1`	`1`	`# Matlab Dynamic Programming`
`2`	`2`
`3`	`3`	`Dynamic Programming has been demostrated by two examples:`
`4`		`-1. Fibonacci squence`
`5`		`-2. Find number of path in the Grid Map with obstacles`
	`4`	`+1. Fibonacci squence`
	`5`	`+2. Find number of path in the Grid Map with obstacles`
`6`	`6`
`7`	`7`	`## Example 1: Fibonacci squence`
`8`	`8`
`@@ -12,6 +12,7 @@ Just run the Fibonacci/EVAL_fibo.m file to compare run-time of the following`
`12`	`12`	`2. Fibo using ___Dynamic programming___`
`13`	`13`	`3. Fibo using ___Matrix Exponentiation___ (Fastest method)`
`14`	`14`
	`15`	`+### MATLAB function`
`15`	`16`	`1. Fibonacci/Fibo_R.m: Fibonacci with Recursive approach:`
`16`	`17`	`* Time Complexity: O(2^n)`
`17`	`18`	`* Space Complexity: O(2^n)`
`@@ -52,7 +53,6 @@ toc;`
`52`	`53`	`tic;`
`53`	`54`	`N2 = GridPath_DP(Map, 1,1)`
`54`	`55`	`toc;`
`55`		`-`
`56`	`56`	```
`57`	`57`
`58`	`58`	`Grid map is as follows:`

Comments

(0)