Computer Science, asked by aylanianju62, 8 hours ago

time complexity is calculated

Answers

Answered by likithsunku
0

Answer:

The time complexity, measured in the number of comparisons, then becomes T(n) = n - 1. In general, an elementary operation must have two properties: There can't be any other operations that are performed more frequently as the size of the input grows.

Answered by ALPHAPANDEY
0

Answer:

The time complexity, measured in the number of comparisons, then becomes T(n) = n - 1.

In general, an elementary operation must have two properties:

There can’t be any other operations that are performed more frequently as the size of the input grows.

The time to execute an elementary operation must be constant: it mustn’t increase as the size of the input grows. This is known as unit cost.

Similar questions