9642827
17845121	80	fibArray is not recursive, test range to small
20021571	100
25252953	100
66944850
74258450
87444153	100
122128368	100
139445190	80	fib(0) = 1. Ofib function incorrect.
149246114	70	fib(0)=1. Iterative: stop count incorrect. Optimized recurrsive: not optimal, basically the same.
159946190	80	iterative: fib(0)=1. Optimized: incorrect.
168542824	100
186149183	80	fib(0)=1, so fib(2)=2. In itFib, also the for loop should be from (2 to n) or( 1 to n-1) or (0 to n-2)
188340006	90	iter: for loop : X=2. return 1 for case of n<=1(or Temp3=1). Opt: N==0,1 return 1, not N==2.
201828593	80	iter: fib(0)=1. Optimized: incorrect.
210424203	100
227444852
240528502	85	opRecur: not optimized.
241225219	90	iter: num1=1 (fib(0)=1), type should be int or long. Opt: num==0,1 return 1.
261829927
283423801	85	fib3 is not a recursive function.
354449824	30
359445115
360226265	100
374864983	60	optRecur and iterative functions are incorrect.
384946889	100
416176840
449344118	85	optRurHelp: should return the fib number. set a[0]=a[1]=1 beforehand. a= new int [n+1].
468545517	80	opt function incorrect.
480127977	100	long long int? Didn't work on my compiler.
499441186	100
524349188	80	recursive: fibonacci(n - 1) + fibonacci(n - 2);(not just +(n-2)). Opt: incorrect.
526748182	97	The time: static_cast should only be applied to the (end-start). otherwise get integer time.
536547118
569065469	85	opt recursive is not recurse, not ehough results
593229534
598155117	85	optimized recursive version incorrect.
638249824	100
641522294	85	optRurHelp: should return the fib number. set a[0]=a[1]=1 beforehand. a= new int [n+1].
643926264
646749154	80	fibo: num1=1. No opt recur.
696345153	100
697647814	100
700329978
709147063
709349114	100
728441194
739643822	100
741121988	100
756542893	90	array not recursive
760427231	80	optRecur.
780329572	95	No file header.
791124581	90	fib(0)=1, error in iter and optRecur.
804853005
829325238
837745185	100
839343561	100
846141816	100
850924979	100
859445896
861127225
863323531	90	iter: n1=1. optRecur: n==0,1 return 1.
866042126
869340810
896345859	100
909242853	100
911423216
919242111
920927543
931220987	80	fib(0)=fib(1)=1. fibArray not optimized.
939348123	100
943028277
947662300	85	arrayFib: not recursive.
949142122	80	fib(0)=fib(1)=1.
961625988
963525279	0	empty folder
987640110