GATE CSE
First time here? Checkout the FAQ!
x
0 votes
101 views

Loading Question

asked in Algorithms by Loyal (4.5k points)   | 101 views
Hey guys ignore the options. What will be the answer by solving the relation?

more appropriate O(qn).

2 Answers

+2 votes

since p and q are constant ...q can have maximum constant value can go upto n....so the second part of the recurrence will give higher order .

so the order can be n^n(option b)

answered by Boss (9.5k points)  
0 votes
we can apply master theoram

a=8 b=2

k=0

a>b^k

so TC= O(n^3)
answered by Boss (7.2k points)  
You'r doing it wrong.
Why didn't you considered term $q^n$.

Let, q = 2;

then, $T(n)  = 8*T(\frac{n}{2}) + 2^n$, which is upper-bounded by $n^n$ only.

Should not option is O(qn). since we dont take heigher value for big-oh.

question is wrong . If it was qn inplace of qn, then C is right .

otherwise O( qn) is more appropriate.

Agree O( 2n) is far far less than O(nn) . 

Related questions

Top Users Jan 2017
  1. Debashish Deka

    8322 Points

  2. sudsho

    5166 Points

  3. Habibkhan

    4718 Points

  4. Vijay Thakur

    4468 Points

  5. Bikram

    4420 Points

  6. saurabh rai

    4212 Points

  7. Arjun

    4082 Points

  8. santhoshdevulapally

    3732 Points

  9. Sushant Gokhale

    3518 Points

  10. GateSet

    3336 Points

Monthly Topper: Rs. 500 gift card

19,159 questions
24,065 answers
52,873 comments
20,288 users