A

A code with θ(n) and θ(n2) complexity. Which code will execute faster for a code of size J ?

August 27, 2021

1 Min Read

0 13

A code with θ(n) and θ(n²) complexity . Which code will execute faster for a code of size J ?

A. θ(n)

B. θ(n²)

C. Cant be said as size of K is unknown

D. Both will be equal

Answer : C. Cant be said as size of K is unknown

Explanation :

Cant be determined as the size of K is not known.

Categorized in:

Tagged in:

A code with θ(n) and θ(n^2), A code with θ(n) and θ(n^2) complexity, algorithm - Big O, algorithm - Determining the big-O runtimes of these, big theta examples, big theta notation examples, codes a and b have complexities, complexity theory in oops, complexity theory in oops questions, how do you calculate/approximate it, How to find time complexity of an algorithm, Most Asked Sapient Nitro Interview Questions, o(n) always faster than o(n^2), object oriented programming in java questions and answers, time complexity What does O(log n) mean exactly, Which code will execute faster for a code of size J

Leave a Reply

Other Stories

T

There are 2 buildings and on each’s window, a flower pot is kept. Ravi’s mother tells him to multiply each cell/window to the other and store in a matrix ? What would be time complexity if he writes a code to do so ?

Next Story

W

Which type of inheritance needs a virtual function ?

Previous Story

Adblocker detected! Please consider reading this notice.

We've detected that you are using AdBlock Plus or some other adblocking software which is preventing the page from fully loading.

We don't have any banner, Flash, animation, obnoxious sound, or popup ad. We do not implement these annoying types of ads!

We need money to operate the site, and almost all of it comes from our online advertising.

Please add wikitechy.com to your ad blocking whitelist or disable your adblocking software.

×