I need someone's opinion Which format is better? The first or second one? I can't decide 0.0

Computers and Technology

2 answers:

zhuklara [117]2 years ago

7 0

The second one looks better imo.
also how do you put more than one photo on brainly?

Ne4ueva [31]2 years ago

4 0

Answer:

2nd one

Explanation:

You might be interested in

I know this is not a school type question but i really need some help.

pashok25 [27]

If I'm not mistaken u can't do that but u can go in your settings if u have an iPhone and add that email with your main one.

8 0

2 years ago

Recursively computing the sum of the first n positive odd integers, cont. About (a) Use induction to prove that your algorithm t

julia-pushkina [17]

The recursive function would work like this: the n-th odd number is 2n-1. With each iteration, we return the sum of 2n-1 and the sum of the first n-1 odd numbers. The break case is when we have the sum of the first odd number, which is 1, and we return 1.

int recursiveOddSum(int n) {

if(2n-1==1) return 1;

return (2n-1) + recursiveOddSum(n-1);

}

To prove the correctness of this algorithm by induction, we start from the base case as usual:

$f(1)=1$

by definition of the break case, and 1 is indeed the sum of the first odd number (it is a degenerate sum of only one term).

Now we can assume that $f(n-1)$ returns indeed the sum of the first n-1 odd numbers, and we have to proof that $f(n)$ returns the sum of the first n odd numbers. By the recursive logic, we have

$f(n)=f(n-1)+2n-1$

and by induction, $f(n-1)$ is the sum of the first n-1 odd numbers, and 2n-1 is the n-th odd number. So, $f(n)$ is the sum of the first n odd numbers, as required:

$f(n)=\underbrace{\underbrace{f(n-1)}_{\text{sum of the first n-1 odds}}+\underbrace{2n-1}_{\text{n-th odd}}}_{\text{sum of the first n odds.}}$