2. Write a script to print series of n terms where n is...

2. Write a script to print series of n terms where n is input by user: 0 1 1 2 3 5 8 13 24 ... ? The next number is found by adding up the two numbers before it: ? the 2 is found by adding the two numbers before it (1+1), ? the 3 is found by adding the two numbers before it (1+2), ? the 5 is (2+3), and so on!

Transcript

00:01 So in this problem we are given that we must use recursion to find the sum of the cd is given over here which in which the i -th element is i by a plus one.

00:13 So it's 1 by 2 plus 2 by 3 and so on.

00:17 And so let's say i is 2 which means it will be for i equal to 2 it will be 1 by 2 plus 2 by 3 and for i equal to 3 it will be 1 by 2 plus 2 by 3 plus 3 by 4.

00:33 Actually yeah this will be the sum so we must find this and we must get this input the i input from the user and then produce the sum using a recursive function not using a following so to do that let's first figure out two things that we must do for a recursive function first is that we must find out what is the operation that repeats so that we can use a function within the function to do that without having to use a follow do and the second condition is that we must find the condition where this stops or a base case or a reference point because when we reach that the recursion must stop otherwise if we don't provide a reference point a function calling itself can either blow out the memory or it can give an error value if the operation doesn't stay within some sensible range so to do that let's first see what we are doing in this case so let's let's first see what we are doing in this case so let's let's let's see what we are doing in this case so let's say there is some i so for i equal to 1 you have 1 plus 2 then for i equal to 2 you have 2 by 2 by 3 which you add so this we got by using i by i plus 1 then for i equal to 3 we have 3 by 4 which we add again so we see that the operation that repeats is find this value and add it added to a recursive function which itself will have then i minus 1 by i minus 1 plus 1 plus a recursion for i minus 2 and so on till i is equal to 1 so in this case we are told that the i starts from 1 because we are given that the first element is 1 by 2 which is when you put i equal to 1 so that becomes our stopping point or the reference point or the base case as it's called so i equal to 1 will be the base case in which case we don't call the function anymore we just just pass one value out as a return value.

02:50 So let me show you the function over here on the right side.

02:52 This is the function where we ask the user to provide an input using the input operation.

03:01 And since this input operation always outputs a string, we are using the eval function to convert that into a integer and then again store it in the same variables.

03:14 So we don't have to make new variables.

03:17 So we are updating the eval function to convert that into a integer and then again store it in the same variables...

Question

Please give Ace some feedback