What is the running time of the following algorithm?
Answers
Answered by
0
Answer:
The fastest possible running time for any algorithm is O(1), commonly referred to as Constant Running Time
Answered by
0
Answer:
The running time of an algorithm for a specific input depends on the number of operations executed. The greater the number of operations, the longer the running time of an algorithm. We usually want to know how many operations an algorithm will execute in proportion to the size of its input, which we will call .
Similar questions