Ask Question
8 January, 17:05

Which of the following growth-rate functions would correspond to the shortest running time?

linear

logarithmic

constant

factorial

+2
Answers (1)
  1. 8 January, 17:19
    0
    The answer is: constant.

    Explanation:

    The Big-Oh analysis informs what is the perform of an algorithm based on the input size (N). Having this in mind you have:

    O (N) linear. O (log N) logarithmic. O (1) constant. O (n!) factorial.

    The shortest running time is the constant function because the running time is always the same and not depends on the size of N.
Know the Answer?
Not Sure About the Answer?
Find an answer to your question 👍 “Which of the following growth-rate functions would correspond to the shortest running time? linear logarithmic constant factorial ...” in 📗 Computers & Technology if the answers seem to be not correct or there’s no answer. Try a smart search to find answers to similar questions.
Search for Other Answers