readme updated

Author: Mansour Torabi

README.md

@@ -3,16 +3,16 @@
 MATLAB Code: Solve Fibonacci Numbers using **Dynamic Programming**, Memoization Implementation in MATLAB
 
 
-1- **Fibo1.m: Fibonacci with Recursive approach:**
-    - Time Complexity:   O(2^n)
-    - Space Complexity:  O(2^n)
+1- **Fibo1.m: Fibonacci with Recursive approach:**\
+    * Time Complexity:   O(2^n)
+    * Space Complexity:  O(2^n)
 
 2- **Fibo2.m: Fibonacci with Dynamic programming (Memoization):**\
-    - Time Complexity:    O(n)
-    - Space Complexity:   O(n)
+    * Time Complexity:    O(n)
+    * Space Complexity:   O(n)
 
 3- **Fibo3.m: Fibonacci with Matrix Exponentiation:**\
-	- Time Complexity:    O(log(n))
+	* Time Complexity:    O(log(n))