Comments updated

Mansour Torabi · Mansour Torabi · commit 7e3da6b8523c · 2021-01-04T18:11:56.000+03:30
diff --git a/EVAL.m b/EVAL.m
@@ -1,3 +1,8 @@
+%%
+% Author: Mansour Torabi, 
+% Contact: smtoraabi@ymail.com
+
+%%
 
 % Using Recursive Method
 tic; Fibo1(40); toc
diff --git a/Fibo1.m b/Fibo1.m
@@ -1,4 +1,10 @@
 function f = Fibo1(n)
+%%
+% Author: Mansour Torabi, 
+% Contact: smtoraabi@ymail.com
+
+%%
+
 % Fibonacci using Recursive Solution
 
 % Time Complexity: O(2^n)
diff --git a/Fibo2.m b/Fibo2.m
@@ -1,4 +1,9 @@
 function F = Fibo2(n)
+%%
+% Author: Mansour Torabi, 
+% Contact: smtoraabi@ymail.com
+
+%%
 % Fibonacci using Dynamic Programming (DP) 
 % DP: recursion + memoziation 
 
diff --git a/Fibo3.m b/Fibo3.m
@@ -1,7 +1,12 @@
 function F = Fibo3(n)
+%%
+% Author: Mansour Torabi, 
+% Contact: smtoraabi@ymail.com
 
+%%
 % Fibonacci Numbers using Matrix Exponentiation
 % Time Complexity:  O(log(n))
+
 f0 = 0;
 f1 = 1;
 
