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.

word_media_image1.png

answers

watching

176

views

For unlimited access to Homework Help, a Homework+ subscription is required.

You have 0 free answers left.
Get unlimited access to 3.8 million step-by-step answers.

Get unlimited access

Already have an account? Log in

mdasfaaruddinshareefLv10

13 Feb 2023

Unlock all answers

Get 1 free homework help answer.

Already have an account? Log in

You have 0 free answers left.
Get unlimited access to 3.8 million step-by-step answers.

Get unlimited access

Already have an account? Log in

mohamedalihammami653Lv2

3 Oct 2022

Already have an account? Log in

You have 0 free answers left.
Get unlimited access to 3.8 million step-by-step answers.

Get unlimited access

Already have an account? Log in

Sixta KovacekLv2

6 Mar 2018

Already have an account? Log in

Related questions

Longer multiple choice questions (3 points each) Coding Question - Fibonacci sequence You are to write a method named "Fibo" that takes as input an integer n, and returns the nth number in the Fibonacci sequence. If Fibo (n) denotes the nth number in the Fibonacci sequence, then recall for n > 2, Fibo (n) = Fibo (n-1) + Fibo (n-2), and Fibo (1) = 1 and Fibo (2) = 1. You are to assume that the user is always going to enter an input greater than 2. For example Fibo (4) = 3. Use the 7 following questions to "write" your code. Pay close attention to how your answers group together with each other. 26. Line 1 (A) public static int Fibo (int n) { (B) public static void main(String[] args) { (C) public static int Fibo () { (D) public static void Fibo (Double input) { (E) public static void Fibo (int n) {

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) {

1.Create a list that contains 10 successive integers starting with the value in the variable start. For example, if start is 7, the resulting list should be [7, 8, 9, 10, 11, 12, 13, 14, 15, 16]. Store the list in a variable named my_list. Assume that the value of start has already been set.

2.Create a list that is made up of the first half of the elements of a list called original_list. Store the new list in a variable called half_list. Assume that the original list has already been initialized and contains an even number of elements.

3. Write a predicate function called same_ends that accepts a list of integers and an integer (n) as arguments. Return True if the first n numbers in the list are the same as the last n numbers in the list, and False otherwise. For example, if the list was [1, 2, 3, 4, 99, 1, 2, 3, 4], the function would return True if n is 4 and False if n is 3. Assume that n is between 1 and the length of the list, inclusive.

4.Write a function called highest_values that accepts as arguments a list of numeric values and a single integer (n). The function should return a list made up of the largest n values from the argument list in order from lowest to highest. For example, if the argument list is [46, 82, 25, 61, 70, 33, 54] and n is 3, the return value should be [61, 70, 82]. Assume that the argument list contains at least n elements.

5.Assume that a list of integers stored in a variable named original contains exactly two elements that are zero. Write code that creates a separate list that contains the elements from original that are between the two zeros. Do not include the zeros in the new list. Store the list in a variable named between_zeros.

6. Write a function called price_range that accepts a list of floating-point numbers representing prices as an argument and returns the the difference between the highest price and the lowest price. Do NOT use the built-in functions max or min in your solution. Assume that all prices are positive values and that none of them exceed 10,000.00.

7. Write a function called count_vowels that accepts a string argument that represents a word and returns the number of vowels that are in the word. The vowels are A, E, I, O, and U (ignore the 'sometimes Y' rule). Count both uppercase and lowercase vowels.

Assume that the variable table holds a two-dimensional list of integers. Write code that computes the sum of all elements in the table, assigning the result to the variable table_sum.