• Write a recursive method named searchList with the following header: • boolean searchList (int[] a, int size, int num) • The method should accept as parameter the following values with the specification mentioned below: • a. A list of integer values • b. Size of the array, size >=5 • c. Number to be searched in the parameter num, num >=0 • The method should return true if the number is contained within the array list and false if the number is not in the array list. • A savings account typically accrues savings using compound interest. If you deposit $1,000 with a 10% interest rate per year, then after one year you have a total of $1,100. If you leave this money in the account for another year at 10% interest, then after two years the total will be $1,210. After three years, you would have $1,331, and so on. • Write a program that inputs the amount of money to deposit, an interest rate per year, and the number of years the money will accrue compound interest. Write a recursive function that calculates the amount of money that will be in the savings account using the input information. To verify your function, the amount should be equal to P(1 + i)n, where P is the amount initially saved, i is the interest rate per year, and n is the number of years.

write program that uses recursion to calculate triangular numbers. Enter a value for the term number, n, and the program will display the value of the corresponding triangular number.shows the triangle.cpp program.

Write a recursive function diff (java) which utilizes two positive integer arguments (x and y) and returns |x – y|. An x - y calculation may not be performed during the function.   Thanks so much for your help!

write a code in java (using recursion)

T/F 3. Iteratively traversing a labyrinth is much faster than recursively traversing one.

Write a recursive function that returns both the smallest and the largest element in an int array. Also, write a program to test your function.

Write a recursive function (Java) called Fac which takes one positive integer argument (n) and returns n! You may not use a built-in factorial method or function.

solve q7 only please

T/F 11. A recursion will still be replaced by an iteration and the other way around.

Java source code writing - a recursive algorithm. Please use non-recursive and recursive ways to compute the nth Harmonic number, defined as H. Turn in your java source code file with three methods, including one main() method.