I am trying to complete an assignment where I have to give an example of a recursive function; my only problem is I don't quite understand recursive functions. Is there any simple way this can be explained or any good website that shows an example of a recursive function-besides wikipedia?
October 5th 2008, 04:50 PM
A recursive function is a function defined by a recursion and initial conditions. One example would be f(n+1) = f(n) + 1 for all n, and f(0) = 0. Of course, this function must be f(x) = x. But not all recursive functions can be written explicitly. Also, your definition of "recursive function" might not include functions that can be written explicitly. What specifically would you like to understand about recursive functions?
October 5th 2008, 06:36 PM
I have to give an example of a recursive function that will can be used in a high school math class, explain how it will be introduced, and describe possible applications of the function.
I saw what you described below in a few textbooks I have but I just do not understand it at all. I submitted the assignment, but what I gave was a recursive situation, not a function. I did the interest on a c.d. over 5 years, having students find out how much each year is gained and graphing the data. But I got it back saying that this was a situation and not a function. (Headbang)