获得C语言的递归级别？

Question

I was writing a recursive function (in C language) and needed a way to know if the recursion had finished. I wonder if I can do it withought variables or flags. With a function for example.

For instance, if the recursion went 3 levels down and then came back up, is there a way to check if I am at level 1....withought using flags?

lev 1 -> lev 2 -> lev 3 -> lev 2 -> lev 1 (check here)

Answer 1

You need to add an extra argument to your function, along the lines of int level . Then pass level+1 when calling yourself recursively, and pass 0 (or 1 if you prefer) to the initial call.

Answer 2

If you don't care about portability, you can unwind the call-stack manually. But I suspect R's solution is vastly better for your problem.

Answer 3

The answer depends on the actual problem. Without storing some sort of flag, you can't tell (in a portable way, that is).

However, it's possible that your recursive function happens to alter some data in such a way that it can tell whether it has previously already entered into a certain recursion depth. On the other hand, this is just a complicated way of saying that you're storing a flag value.

Answer 4

也许您可以只检查调用堆栈，但这将取决于您要处理的实际级别或递归，否则，如果仅出于调试/理解的目的，请使用R ..解决方案。

Answer 5

if you want to play with stack ...

int  func(void *p,int n, int stacksize)
{
 char marker;
 int depth =  (int)p -(int)&marker ;
 printf("%d --- %d --- %d\r\n", n,depth, stacksize?depth/stacksize:0);
 if (n>10)
    return depth ;

 return func(p,n+1,stacksize);
}


int main()
{
  char marker;
  int onepass = func(&marker,11,0);

  func(&marker,0,onepass );
  return 0;
}