I have to design a recursive (not iterative)function that allows me to calculate a scalar product of two vectors of n dimensions.Example:returns 14.25.Code:dot_product ({1.5.2.7.3.0}, {3.0,2.5,1.0}, 3)
variables
Any idea of how to do it?Code:a : vector [MAX] of real, b : vector [MAX] of real, n: integer real Returns a real.
I'm just starting with C.
Thanks,
Tada!Code:if ( n == 0 ) { return a[0] * b[0]; } else { return a[0] * b[0] + recursive(a+1,b+1,n-1); }
If you dance barefoot on the broken glass of undefined behaviour, you've got to expect the occasional cut.
If at first you don't succeed, try writing your phone number on the exam paper.
Ok thanks.
Now I have to design another recursive function that calculates the positive divisors sum of a number n. The initial call to a function is sum_divisors (n,1). Exemple: calling sum_divisors (6,1) is 12, because the 6 divisors are 6,3,2,1.
the function is: sum_divisors(n: integer, d:integer): integer.
Could you help me to develop this code?
thanks!
Well did you understand what was going on in the version I posted.
Can you for example write the function using a regular for loop?
Recursion after all is just a disguised loop.
If you dance barefoot on the broken glass of undefined behaviour, you've got to expect the occasional cut.
If at first you don't succeed, try writing your phone number on the exam paper.
I think yes.
But not clear to convert it to recursive.Code:int sum_div(int n, int j){ int sum = 0; int i; for (i=1; i<=n; i++){ if(n%i==0){ sum = sum +i; } } return sum; }
An example with the classic factorial function: Writing the routine with a loop you can do something like this (not considering overflows):
The recursive approach is almost the same thing as the loop above, but we have an EXIT-LOOP condition:Code:unsigned int fact(unsigned int n) { // 0! == 1 unsigned int r = 1; // kept in the loop until n <= 1! while ( n > 1 ) { r *= n; n = n - 1; } return r; }
Code:unsigned int fact_r(unsigned int n) { // kept in the loop until n > 1! // or EXIT the loop if n <= 1. if ( n <= 1 ) return 1; return n * fact_r(n - 1); }
Last edited by flp1969; 04-02-2019 at 08:45 AM.
The question is that I have to fill the dot spaces of the algoritm:
//algorithmic notation
The initial function call is doing this way:Code:int function sum_divisors (int n, int d){ int result; if(n = d) { result = ...... //I think 1 } else { result = ........ } if ...... { result = ...... } end if end if return result; end function
sum_divisors(n,1);
Sorry, but still not sure how to do it.
All recursion boils down to
- a base case that is trivially solvable
- a recursive case which provides a partial solution, and one (or more) recursive calls to solve a self-similar sub-problem.
If you dance barefoot on the broken glass of undefined behaviour, you've got to expect the occasional cut.
If at first you don't succeed, try writing your phone number on the exam paper.
