A community for students.

Here's the question you clicked on:

55 members online
  • 0 replying
  • 0 viewing


  • one year ago

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)

  • This Question is Open
  1. anonymous
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    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.

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

    • Attachments:

Ask your own question

Sign Up
Find more explanations on OpenStudy
Privacy Policy

Your question is ready. Sign up for free to start getting answers.

spraguer (Moderator)
5 → View Detailed Profile

is replying to Can someone tell me what button the professor is hitting...


  • Teamwork 19 Teammate
  • Problem Solving 19 Hero
  • You have blocked this person.
  • ✔ You're a fan Checking fan status...

Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.

This is the testimonial you wrote.
You haven't written a testimonial for Owlfred.