Berkeley CSUA MOTD:Entry 28438
Berkeley CSUA MOTD
 
WIKI | FAQ | Tech FAQ
http://csua.com/feed/
2025/05/30 [General] UID:1000 Activity:popular
5/30    

2003/5/14-15 [Uncategorized] UID:28438 Activity:nil
5/14    How do I solve the recurrence:
        t(n)=clogn + cn^x + t(n^(1-x)) + t(3n/4),
                where c=constant and 0<x<1?
        \_ Do your own 170 homework.