minor refactor

AhmedLSayed9 · AhmedLSayed9 · commit 8145b2552baa · 2023-05-22T17:57:39.000+03:00
diff --git a/dynamic_programming/fibonacci.dart b/dynamic_programming/fibonacci.dart
@@ -9,7 +9,7 @@ void main() {
   syncExecTimeMeasure(() => print(fibRecursive(45)), name: 'O(n^2)');
 }
 
-// Tabulation (Bottom-up approach in Dynamic Programming)
+// Tabulation (Bottom-up approach in Dynamic Programming) (usually done using iteration).
 // Time Complexity: O(n), and better Auxiliary Space.
 fibTabulated(int n) {
   if (n <= 0) throw ArgumentError('Input must be a positive integer');

Original file line number	Diff line number	Diff line change
`@@ -9,7 +9,7 @@ void main() {`
`9`	`9`	`syncExecTimeMeasure(() => print(fibRecursive(45)), name: 'O(n^2)');`
`10`	`10`	`}`
`11`	`11`
`12`		`-// Tabulation (Bottom-up approach in Dynamic Programming)`
	`12`	`+// Tabulation (Bottom-up approach in Dynamic Programming) (usually done using iteration).`
`13`	`13`	`// Time Complexity: O(n), and better Auxiliary Space.`
`14`	`14`	`fibTabulated(int n) {`
`15`	`15`	`if (n <= 0) throw ArgumentError('Input must be a positive integer');`