V
vamsi
Hi,
I am doing a performance profiling of my 'C' application. I would like
to know, if replacing a recursive function with a non-recursive
version of it will save CPU cycles.
One reason why it could improve performance, could be it could save
all the stack pushes and pops, when the function call happens or
returns. Also, in one of my past applications, replacing a function
call with an inline code did improve performance, and so I derived the
same.
Changing the function to non-recursive version, will take some effort.
I would like to know this info before proceeding.
If anyone has any data/observation in the past or comments/
suggestions, please let me know.
Regards,
Vamsi
I am doing a performance profiling of my 'C' application. I would like
to know, if replacing a recursive function with a non-recursive
version of it will save CPU cycles.
One reason why it could improve performance, could be it could save
all the stack pushes and pops, when the function call happens or
returns. Also, in one of my past applications, replacing a function
call with an inline code did improve performance, and so I derived the
same.
Changing the function to non-recursive version, will take some effort.
I would like to know this info before proceeding.
If anyone has any data/observation in the past or comments/
suggestions, please let me know.
Regards,
Vamsi