Website Summary Files Commits Branches @commit @diff @stats
path: root / Seminar02 / recursion.cpp
diff options
context:
space:
mode:
Commit7eee5a78005a9a569186d2c8b4b645a818ab9bf1 (patch)
Author
 Stoycho Kyosev <skyosev@192.168.100.17>
2024-10-06 07:04:44 -0400
Committer
 Stoycho Kyosev <skyosev@192.168.100.17>
2024-10-06 07:04:44 -0400
Files84594e0af29cefa5aae76ace5f8eb81484400e31 /Seminar02/recursion.cpp
Data-structures-and-algorithms-7eee5a78005a9a569186d2c8b4b645a818ab9bf1.tar
Data-structures-and-algorithms-7eee5a78005a9a569186d2c8b4b645a818ab9bf1.tar.gz
Data-structures-and-algorithms-7eee5a78005a9a569186d2c8b4b645a818ab9bf1.zip
Parent0841635826cb03c0e74cd75ec3c97c4c3b594d8b (diff)
Cleanup
1 files changed, 0 insertions, 33 deletions
-rw-r--r--Seminar02/recursion.cpp33
diff --git a/Seminar02/recursion.cpp b/Seminar02/recursion.cpp
deleted file mode 100644
index 63f4aa0..0000000
--- a/Seminar02/recursion.cpp
+++ /dev/null
@@ -1,33 +0,0 @@
-#include<iostream>
-#include<stack>
-
-int fib(unsigned x) {
- if(x == 0 || x == 1)
- return 1;
-
- return fib(x - 1) + fib(x - 2);
-}
-
-// Малък пример как можем да симулираме рекурсия чрез стек.
-int fibStack(unsigned x) {
- std::stack<unsigned> s;
- s.push(x);
- int result = 0;
-
- while(!s.empty()) {
- int currArg = s.top();
- s.pop();
-
- if(currArg == 1 || currArg == 0)
- ++result; // Еквивалентно на return 1;
- else{
- s.push(currArg - 1); // Еквивалентно на fib(x - 1);
- s.push(currArg - 2); // Еквивалентно на fib(x - 2);
- }
- }
- return result;
-}
-
-int main() {
- std::cout << fib(10) << " " << fibStack(10);
-}