anonymous
  • anonymous
Recurrence relation - how to find it for a function? Assume that n is the number of elements of A[first, . . . , last], that is, n = last − first + 1. Algorithm jelly(A, first, last) if (n < 8) then return A[first] + A[last] third ← (2 * first + last) / 3 return jelly(A, first + 3, last - 2) * jelly(A, first, third)
MIT 6.00 Intro Computer Science (OCW)
katieb
  • katieb
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.

Get this expert

answer on brainly

SEE EXPERT ANSWER

Get your free account and access expert answers to this
and thousands of other questions

anonymous
  • anonymous
If you mean recurrence as in recursion then you need to think of both the n-1 and base case. I would suggest trying to think of what the base case is and then the next case etc. If you cannot do this then the problem cannot be solved by recursion.

Looking for something else?

Not the answer you are looking for? Search for more explanations.