solve the following relation by recursive method: T(n)=2T(n^1/2)+log n

Posted Date: 12/24/2012 12:12:22 AM | Location :

Ask an Expert

Related Discussions:- recurrence relation, Assignment Help, Ask Question on recurrence relation, Get Answer, Expert's Help, recurrence relation Discussions

Write discussion on recurrence relation
Your posts are moderated

Write your message here..

Related Questions

Order of the matrix, /* The program accepts matrix like input & prints the ... /* The program accepts matrix like input & prints the 3-tuple representation of it*/ #include void main() { int a[5][5],rows,columns,i,j; printf("enter the order of

Define the term - array, Define the term - Array A fixed length, ord... Define the term - Array A fixed length, ordered collection of values of same type stored in contiguous memory locations; collection may be ordered in several dimensions.

Define chaining process of hashing, Chaining In this method, instead of... Chaining In this method, instead of hashing function value as location we use it as an index into an array of pointers. Every pointer access a chain that holds the element havi

Assignment, How do I submit a three page assignment How do I submit a three page assignment

Entity relationship, what is cardinality what is cardinality

Algo for quicksort, Easy algorithm for beginner for quicksort with explanat... Easy algorithm for beginner for quicksort with explanation

Breadth first traversal, The data structure needed for Breadth First Traver... The data structure needed for Breadth First Traversal on a graph is Queue

Frequency count, what is frequency count with examble what is frequency count with examble

Explain the bubble sort algorithm, Explain the bubble sort algorithm. ... Explain the bubble sort algorithm. Answer This algorithm is used for sorting a list. It makes use of a temporary variable for swapping. It compares two numbers at an insta

What are circular queues, What are circular queues?  Circular queue: St... What are circular queues?  Circular queue: Static queues have a very large drawback that once the queue is FULL, even though we erase few elements from the "front" and relieve