// Among indexes first...last, return index of the target. // If target is not present then return -1. // precondition: the elements of array are in descending order. static int find(int [] array, int first, int last, int target) if (first > last) { // one very short line } if (first == last) { // one line, using the conditional operator } int mid = (first+last+1)/2; if (target <= array[mid]) { // one line, involving a recursive call } // one line, involving a recursive call

Write java program recursive method to display all odd numbers from the given number to 1 .

Show a definition for a recursive Java method long powerOf2(int n) that returns the value of 2" (assume n is non-negative).

import java.util.Scanner; public class LabProgram {   /* Define your method here */      public static void main(String[] args) {      Scanner scnr = new Scanner(System.in);       /* Type your code here. */   }}

3. Write a Java program to implement a method which prints the Fibonacci series up to nth term. The value of n will be taken from the user in the main() method.Fibonacci series starts with 0 and 1, and the sum of previous two numbers is the next number of the series. For instance, 0, 1, 1 (0 + 1), 2 (1 + 1), 3 (1 + 2), and so on.Sample output [assuming the number of term (n) is 8]:The Fibonacci series: 0 1 1 2 3 5 8 13

Write Java program for employees (keeps track of our employees) and then we need 5 employees with different names (assign names).

I have two questions: Is my programs code the most effective way at finding recursion or is there a much better and cleaner way? Why is the program showing 0 when I implement a number that depth is greater than 100? Shouldn't it show the number 1?   Source code: package recursiveModule; public class RecursiveMethod {    public static long calculateFactorial(int n, int depth) {        if (depth > 100 || n <= 1) {            return 1;        }                return n * calculateFactorial(n - 1, depth + 1);    }          public static void main(String[] args) {                             System.out.println("Factorial of 1 is " + RecursiveMethod.calculateFactorial(1, 0));                System.out.println("Factorial of 8 is " + RecursiveMethod.calculateFactorial(8, 0));                                      System.out.println("Factorial of 101 is " + RecursiveMethod.calculateFactorial(101, 0));                                   } }