Which algorithm segment completes the definition for an iterative version of the factorial function? Int factorial_i (int n) { Int result = 1; /** missing code inserted here */ __________ Return result ; } A) if (n == 0) return 1; else if (n 0) return n * factorial_i(n - 1); else B) if (n == 0) return result; else if (n 0) return n * factorial_i(n - 1); else C) for (int i = 1; i

Question

Which algorithm segment completes the definition for an iterative version of the factorial function? Int factorial_i (int n) { Int result = 1; /** missing code inserted here */ __________ Return result ; } A) if (n == 0) return 1; else if (n > 0) return n * factorial_i(n - 1); else B) if (n == 0) return result; else if (n > 0) return n * factorial_i(n - 1); else C) for (int i = 1; i <= n; i++) result *= i; D) for (int i = 1; i <= n; i++) n *= i;

Quizplus · Accepted Answer

Option C correctly implements an iterative approach to calculate the factorial of a number by using a for loop to multiply the result variable by each number from 1 to n.

Which Algorithm Segment Completes the Definition for an Iterative Version