The following is a pseudocode algorithm for a recursive function that returns the factorial of a...

Transcribed Image Text:

The following is a pseudocode algorithm for a recursive function that returns the factorial of a non-negative integer n. The algorithm works for most input but is missing out on one edge case. FUNCTION Factorial (n) if n = 1 else result 1 result = n* Factorial (n-1) Task 2.1 Write program code for this algorithm including the amendment you would make to: make the function works for all cases adhere to good programming style Verify that your program works by testing it for suitable values of n<=100. Evidence 7: Your program code. Evidence 8: Two screenshots showing the output from running the program code for n=0) and n=50. Task 2.2 While concise and elegant, recursive functions are more computationally resource intensive, and break down when the input size is large (e.g. when n=1000 for the above recursive factorial function). To improve its efficiency and ability to handle large input sizes, convert the recursive factorial function into an iterative one. Evidence 9: Your converted program code. Evidence 10: One screenshot showing the output from running the program code for n=1000. The following is a pseudocode algorithm for a recursive function that returns the factorial of a non-negative integer n. The algorithm works for most input but is missing out on one edge case. FUNCTION Factorial (n) if n = 1 else result 1 result = n* Factorial (n-1) Task 2.1 Write program code for this algorithm including the amendment you would make to: make the function works for all cases adhere to good programming style Verify that your program works by testing it for suitable values of n<=100. Evidence 7: Your program code. Evidence 8: Two screenshots showing the output from running the program code for n=0) and n=50. Task 2.2 While concise and elegant, recursive functions are more computationally resource intensive, and break down when the input size is large (e.g. when n=1000 for the above recursive factorial function). To improve its efficiency and ability to handle large input sizes, convert the recursive factorial function into an iterative one. Evidence 9: Your converted program code. Evidence 10: One screenshot showing the output from running the program code for n=1000.

Answer rating: 100% (QA)

Task 21 Recursive Factorial Function Heres the modified program ... View the full answer