POL SCI 149E Lecture 2: PS 149 Lecture 2

Recursion Question 5. In the following question, you will be asked to program the following using recursion. If you have an iterative solution, you may use it, but the most you can get for the question will be half credit. (5) points) Consider the following mathematical function h which operates on integers. (1, if n < 2 h(n) = n(n-1) +n if n > 2 and n is even han -2) +2*n if n > 2 and n is odd In Java, use recursion to write a method h which takes as input an int n and returns h (n). public static int h(int n) {

35. (2 points) Write a method/function named fact that computes n! (n factorial). Recall that n! is nx (n-1)(n-2)... x 2x1 for n greater >0 and ! is 1. You can assume your method is only passed non-negative values of n.

Part (a) [3 MARKS] Consider this program: Fill in the Python Shell output after this program has executed. >>> X L = [4, 10, 8] X = L. sort L.append(20) L2 = L[1:] >>> L >>> id(L) == id(L2)