Finding Time Complexity for a recurence relation
Can anyone explain me how to find time complexity for the below recurrence relation
T(n)= c (Constant) if n=1
n^1/2T(n^1/2)+n if n>1
Thanks in advance
T(n)= c (Constant) if n=1
n^1/2T(n^1/2)+n if n>1
Thanks in advance
Replies
You are reading an archived discussion.
Related Posts
You don’t need to be upset if your vehicle components do not permit you to listen to razor sharp quality music. Ford car owners across UK will soon get to...
Dr. Rajib Mall, Department of Computer Science & Engineering, IIT Kharagpur explained the concept of Real-Time task scheduling on Microprocessors and Distributed systems in the Real-Time systems. Feel free to...
Dr. Rajib Mall, Department of Computer Science & Engineering, IIT Kharagpur explained the concept of Clock Synchronization in Distributed Real-Time Systems. Feel free to share your ideas and ask your...
Dr. Rajib Mall, Department of Computer Science & Engineering, IIT Kharagpur explained the concept of Internal Clock Synchronization in Presence of Byzantine Clocks in Real-Time Systems. Feel free to share...
Dr. Rajib Mall, Department of Computer Science & Engineering, IIT Kharagpur explained the various basic issues involved in the Real-Time Operating Systems. Feel free to share your ideas and ask...