2 years ago

How do we find the time complexity for this algorithm?

Computers and Technology

1 answer:

gizmo_the_mogwai [7]2 years ago

8 0

Answer:

For any loop, we find out the runtime of the block inside them and multiply it by the number of times the program will repeat the loop. All loops that grow proportionally to the input size have a linear time complexity O(n) . If you loop through only half of the array, that's still O(n) .

You might be interested in

Portable Document Format (PDF) is a file format that provides an electronic image of a document and can be viewed, printed, and

bogdanovich [222]

True a pdf is a file format that provides a electronic image of a document and it can be viewed, printed and electronically transmitted.

7 0

3 years ago

Read 2 more answers

Janeal spends her day looking at the stock and bond markets and evaluating how the portfolios of the businesses she serves will

pychu [463]

Answer:

ur answer good sir will be : financial analyst

and a brainliest will be good to thnx