GATE CSE
First time here? Checkout the FAQ!
x
+3 votes
50 views

asked in Algorithms by Veteran (42.7k points)   | 50 views
whats the answer?Is it O(n log N) ?? I am trying by substitution.

1 Answer

+2 votes
Best answer

t(n)=√nt(√n)+n
using recurence tree method
every time our main problem goes decreases to n->n1/2->n1/4......n1/2^k
nd cost of reduction for size k is √k where k is a function of n 
so after how much time our subproblem becom of size 1 0r 2 i mean when cost becomes constant
.n1/2^k=2  k=loglogn
here cost at each level is same at each level bcoz our main problem is uniformally divided =n
so  total cost using recurence tree method =
    no of levels*cost at each level = loglogn * n=nloglogn
Ans=θ(nloglogn)

answered by Veteran (10.5k points)  
selected by

Related questions

+1 vote
2 answers
1
asked in Algorithms by LavTheRawkstar Boss (5.5k points)   | 71 views


Top Users Apr 2017
  1. akash.dinkar12

    3660 Points

  2. Divya Bharti

    2580 Points

  3. Deepthi_ts

    2040 Points

  4. rude

    1966 Points

  5. Tesla!

    1768 Points

  6. Debashish Deka

    1614 Points

  7. Shubham Sharma 2

    1610 Points

  8. Prashant.

    1492 Points

  9. Arjun

    1472 Points

  10. Arunav Khare

    1464 Points

Monthly Topper: Rs. 500 gift card

22,086 questions
28,062 answers
63,297 comments
24,169 users