71 lines
1.6 KiB
Dart
71 lines
1.6 KiB
Dart
/**
|
|
* File: recursion.dart
|
|
* Created Time: 2023-08-27
|
|
* Author: liuyuxin (gvenusleo@gmail.com)
|
|
*/
|
|
|
|
/* Recursion */
|
|
int recur(int n) {
|
|
// Termination condition
|
|
if (n == 1) return 1;
|
|
// Recursive: recursive call
|
|
int res = recur(n - 1);
|
|
// Return: return result
|
|
return n + res;
|
|
}
|
|
|
|
/* Simulate recursion with iteration */
|
|
int forLoopRecur(int n) {
|
|
// Use an explicit stack to simulate the system call stack
|
|
List<int> stack = [];
|
|
int res = 0;
|
|
// Recursive: recursive call
|
|
for (int i = n; i > 0; i--) {
|
|
// Simulate "recursive" by "pushing onto the stack"
|
|
stack.add(i);
|
|
}
|
|
// Return: return result
|
|
while (!stack.isEmpty) {
|
|
// Simulate "return" by "popping from the stack"
|
|
res += stack.removeLast();
|
|
}
|
|
// res = 1+2+3+...+n
|
|
return res;
|
|
}
|
|
|
|
/* Tail recursion */
|
|
int tailRecur(int n, int res) {
|
|
// Termination condition
|
|
if (n == 0) return res;
|
|
// Tail recursive call
|
|
return tailRecur(n - 1, res + n);
|
|
}
|
|
|
|
/* Fibonacci sequence: Recursion */
|
|
int fib(int n) {
|
|
// Termination condition f(1) = 0, f(2) = 1
|
|
if (n == 1 || n == 2) return n - 1;
|
|
// Recursive call f(n) = f(n-1) + f(n-2)
|
|
int res = fib(n - 1) + fib(n - 2);
|
|
// Return result f(n)
|
|
return res;
|
|
}
|
|
|
|
/* Driver Code */
|
|
void main() {
|
|
int n = 5;
|
|
int res;
|
|
|
|
res = recur(n);
|
|
print("\nResult of recursive sum function res = $res");
|
|
|
|
res = tailRecur(n, 0);
|
|
print("\nResult of tail-recursive sum function res = $res");
|
|
|
|
res = forLoopRecur(n);
|
|
print("\nSum result using iteration to simulate recursion res = $res");
|
|
|
|
res = fib(n);
|
|
print("\nThe $n-th term of the Fibonacci sequence is $res");
|
|
}
|