What is the order of the algorithm? Running time of an algorithm - ProProfs Discuss
Topics-
Products +
     

What is the order of the algorithm? Running time of an algorithm T(n), where n is input size is given by T(n) = 8 T(n/2) + qn, if n>1 T(n) = p, if, n=1 where p and q are constants.



A. N2
B. Nn
C. N3
D. N

This question is part of Gate Data Structure Online Test
Asked by Nauakrimilgai, Last updated: Oct 04, 2018

+ AnswerRequest Answer
...

2 Answers

J. Emmerich

J. EmmerichWeb Content Writer, New York City
Web Content Writer, New York City

Answered on Oct 04, 2018

The order of the algorithm is letter C. An algorithm is known to be a set that is composed of rules and other operations that will be followed by devices. The computer uses this often in order to serve certain problems easily. Even if this is done by computers and other gadgets in a short amount of time, this follows a step-by-step process.

If this process is not followed, then the wrong answer may be received. This will not be ideal at all. Aside from being used for complicated calculations, algorithms can also be used to do data processing and reasoning tasks.

 Reply

John Smith

John Smith

Answered on Jan 09, 2017

N3
 Reply

Search for Google images
Select a recommended image
Upload from your computer
Search for Google images
Select a recommended image
Upload from your computer
Search for Google images
Select a recommended image
Upload from your computer

Email Sent
We have sent an email to your address "" with instructions to reset your password.