The iterative and recursive algorithms used to compute a factorial value are O(__________), because the number of loop repetitions or recursive calls increases linearly with n. A) 1 B) log₂ n C) n D) n log₂n

Question

Quizplus · Accepted Answer

The time complexity for both iterative and recursive algorithms to compute a factorial is O(n) because the number of steps (either loop iterations or recursive calls) increases linearly with the input value n.

The Iterative and Recursive Algorithms Used to Compute a Factorial