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?
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
