Tail recursion in C++

by

A simple tail recursive function:

unsigned int f( unsigned int a ) {
   if ( a == 0 ) {
      return a;
   }
   return f( a - 1 );   // tail recursion
}

Tail recursion is basically when:

  • there is only a single recursive call
  • that call is the last statement in the function

And it’s not “better”, except in the sense that a good compiler can remove the recursion, transforming it into a loop. This may be faster and will certainly save on stack usage. The GCC compiler can do this optimisation.

More Related Contents:

  1. does cout before return statement of recursive function stops it?
  2. How to compile a program with limit time (5s), using MinGW-Gnu C++
  3. Undefined reference to static class member
  4. Compiling C++11 with g++
  5. Error: free(): invalid next size (fast):
  6. How does #include work in C++? [duplicate]
  7. What exactly is a reentrant function?
  8. Why is my integer math with std::pow giving the wrong answer?
  9. Headers Including Each Other in C++
  10. C++ standard library and Boehm garbage collector
  11. How to create a static library with g++?
  12. 😃 (and other Unicode characters) in identifiers not allowed by g++
  13. Linking g++ 4.8 to libstdc++
  14. Linking to MSVC DLL from MinGW
  15. extra qualification error in C++
  16. Are C++17 Parallel Algorithms implemented already?
  17. GCC: Difference between -O3 and -Os
  18. cc1plus: error: unrecognized command line option “-std=c++11” with g++
  19. Compile c++14-code with g++
  20. Linking files in g++
  21. Recursion in c++ Factorial Program
  22. What is a .h.gch file?
  23. C++ template function compiles in header but not implementation
  24. Do I really have to worry about alignment when using placement new operator?
  25. Why can’t I use with g++ 4.9.2?
  26. Why does stack not compile in g++? [duplicate]
  27. Eclipse C++ : “Program “g++” not found in PATH”
  28. get part of std::tuple
  29. get part of std::tuple
  30. std::array with aggregate initialization on g++ generates huge code

Leave a Comment