Register
Dark Mode

Time complexity

in Algorithms
506 views
1 vote
1 vote
what is time complexity for T(n) = √n.T(√n) + √n ?
in Algorithms
by
506 views

2 Answers

1 vote
1 vote
Best answer

Short Answer - $\Theta (n)$

Long Answer - By using substitution method, the recurrence equation can be solved as follows,

(If the image below is not viewable, then open this link - https://goo.gl/6lBE0i)

selected by
by
1 vote
1 vote

Answer

by
← PreviousNext →
← Previous in categoryNext in category →

No related questions found

Subscribe to GATE CSE 2024 Test Series

Subscribe to GO Classes for GATE CSE 2024

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

Subjects

64.3k questions

77.9k answers

244k comments

80.0k users

Developed by Chun
Link Copied!