Loading [MathJax]/extensions/TeX/AMSmath.js
Jump to content

donohoe147

New Members
  • Posts

    1
  • Joined

  • Last visited

Everything posted by donohoe147

  1. hi struggling with this problem, don't understand the topic recursion Exercise 3. Let f(n) = f(ceiling n/2)+n, and let g(n) = g(n􀀀1)+2n with g(1) = 0. Calculate the following values by unfolding. 1. f(5) 2. f(9) 3. g(6) 4. g(9) any advice or help would be appreciated regards im not looking for answers just a bit of advice or an example. i have james hein s book on discrete maths , logic and computability
×
×
  • Create New...

Important Information

We have placed cookies on your device to help make this website better. You can adjust your cookie settings, otherwise we'll assume you're okay to continue.