Ask Experts Questions for FREE Help !
Ask
    basirou's Avatar
    basirou Posts: 12, Reputation: 1
    New Member
    		  
    #1

    Nov 1, 2010, 08:09 AM
    T(n)=10T(n/3) 5n2
    T(n)=10T(n/3) 5n2
    Unknown008's Avatar
    Unknown008 Posts: 8,076, Reputation: 723
    Uber Member
    		  
    #2

    Nov 1, 2010, 12:08 PM

    Uh... right...

    What's the question?

    And after you typed your question, could you please show us what you tried?
    galactus's Avatar
    galactus Posts: 2,271, Reputation: 282
    Ultra Member
    		  
    #3

    Nov 1, 2010, 02:06 PM
    What's wrong, Unknown? You have not learned how to read minds yet? You're supposed to know what that means. :):)
    Unknown008's Avatar
    Unknown008 Posts: 8,076, Reputation: 723
    Uber Member
    		  
    #4

    Nov 1, 2010, 11:28 PM

    Doh Cody... I should have know I need to switch on the mind reader :p
    basirou's Avatar
    basirou Posts: 12, Reputation: 1
    New Member
    		  
    #5

    Nov 2, 2010, 04:07 AM
    Give the tightest asymptotic bounds for T(n) in the this recurences T(n)=10T(n/3) 5n2?
    Please I need your help
    Unknown008's Avatar
    Unknown008 Posts: 8,076, Reputation: 723
    Uber Member
    		  
    #6

    Nov 2, 2010, 05:32 AM

    Is that it?



    ?

    :confused:
Not your question? Ask your question View similar questions
 

Question Tools Search this Question
Search this Question:

Advanced Search

Add your answer here.


View more questions Search