title: In turbo c++ can a normal recursive function converted as tail-recursive to optimize it?
body: <p>I'm creating one factorial program in c++ using normal recursion function. I want to convert it to tail recursion to prevent stack overflow if the input value is large. How can I convert my normal recursion to tail recursion?</p>
  
  <pre><code>// An example of tail recursive function
  void print(int n)
  {
     if (n &lt; 0)  return;
     printf(" %d",n);
  
      // The last executed statement is recursive call
      print(n-1);
   }
  </code></pre>