Friday, April 12, 2013

New Urgent Fresher Junior Java Developer (0-1 Yrs.) jobs (1 Jobs)

at
Labels:

1 comment:

  1. sandeepJuly 4, 2013 at 2:56 AM

    The solution of recurrence relation,
    T(n)=2T(floor(sqrt(n)))+log n is?
    a)O(nlog log logn)
    a)O(nlog logn)
    a)O(log logn)
    a)O(logn log logn)

    ReplyDelete

Subscribe to: Post Comments (Atom)