0 votes
in Programming Languages & Algorithms by (user.guest)

1 Answer

+1 vote
by (user.guest)
selected by (user.guest)
Best answer
A recursive function can be described as any that calls its self during its course of execution. Based on the function and parameters passed to it, it repeats for a number of times. An example of a recursive function is the factorial function.

Related questions

0 votes
1 answer 301 views
0 votes
1 answer 1.3k views
+1 vote
1 answer 2.1k views
Welcome to CPENTalk.com
Solution-oriented students of computer engineering on one platform to get you that