On Mar 29, 9:52 am, dmjcunha <dmjcu...@gmail.com> wrote: > On Mar 29, 9:50 am, dmjcunha <dmjcu...@gmail.com> wrote: > > > On Mar 29, 9:41 am, dmjcunha <dmjcu...@gmail.com> wrote: > > > > Hi, If I have a recurrence relation defined as: > > > _ _ > > > |_ _| -> floor function. | | -> ceiling function > > > _ _ > > > Pn = |_n/2_| + P|_n/2_| + P| n/2 | for n >=1 with P0 = 0 > > > > for n = 1 I have: > > > P1 = 0 + 0 + P1 so I have P1 again and enter in an infinity loop. > > > > Did this exercise forget to define P1 or am I missing something? > > > The underscores went to the wrong place, I am trying to fix.
-- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
