What is the order of the algorithm? Running time of an algorithm - ProProfs Discuss  + Ask Question

# 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: Jul 16, 2020

### Request 0Follow Share     Answer AnonymouslyAnswer Later Copy Link  J. Emmerich, Web Content Writer, New York City

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.   John Smith N3    Search for Google images Select a recommended image
Upload from your computer Cancel  Search for Google images Select a recommended image
Upload from your computer Cancel  Search for Google images Select a recommended image
Upload from your computer Cancel   