Facebook
From G, 1 Month ago, written in Plain Text.
Embed
Download Paste or View Raw
Hits: 130
  1. #include <iostream>
  2.  
  3. long long fibrTail(int n, long long a = 0, long long b = 1) {
  4.     if (n == 0) return a;
  5.     if (n == 1) return b;
  6.     return fibrTail(n - 1, b, a + b);
  7. }
  8.  
  9. int main() {
  10.     int n = 50;
  11.     std::cout << "Fibonacci of " << n << " using tail recursion is " << fibrTail(n) << std::endl;
  12.     return 0;
  13. }