convert the recursion code to alterative code in java public int array11(int[] nums, int index) { if (index == nums.length) return 0; if (nums[index] == 11) return 1 + array11(nums, index + 1); return array11(nums, index + 1); }

Java programming homework please help

in java Describe the definition of recursive function. oBase case(s)oRecursive case(s)2. Write the code part of code below public class ReverseArray { public static void main(String[] args) { // TODO Auto-generated method stub public static void reverseArray(int[] data,int low, int high ) { if(low < high) { int temp = data[low]; data[low] = data[high]; data[high] = temp; reverseArray(data, low + 1, high -1); } }

Write a recursive method in java that sums all values between s and n inclusive /* assume s is less than or equal to n to start */ public static int sum(int s, int n) { }

JAVA Language: Transpose Rotate. Question: Modify Transpose.encode() so that it uses a rotation instead of a reversal. That is, a word like "hello" should be encoded as "ohell" with a rotation of one character. (Hint: use a loop to append the letters into a new string) import java.util.*; public class TestTranspose { public static void main(String[] args) { String plain = "this is the secret message"; // Here's the message Transpose transpose = new Transpose(); String secret = transpose.encrypt(plain); System.out.println("\n ********* Transpose Cipher Encryption *********"); System.out.println("PlainText: " + plain); // Display the results System.out.println("Encrypted: " + secret); System.out.println("Decrypted: " + transpose.decrypt(secret));// Decrypt } } abstract class Cipher { public String encrypt(String s) { StringBuffer result = new...

int arr[] = {-2, -4, 8, 4, 3, 3, -9};In Java with this given this array, how would this version of Divide and Conqueror be implemented in this case, specifically?

jhfgjgjgj

Write a statement that calls the recursive method backwardsAlphabet() with parameter starting Letter. 789GHA 10 11 12 13 } TENN 14 15 16 17 18 19 20 21 22 } 23 } } else { } System.out.print(currLetter + "); backwardsAlphabet((char) (currLetter - 1)); public static void main (String[] args) { Scanner scnr = new Scanner(System.in); char startingLetter; startingLetter = scnr.next().charAt(0); /* Your solution goes here */ ▶

Declaration for an integer 2-D array X with the size 3 rows and 4 columns in C is int X(3) (4); double X=[3] [4]; integer X[3] [4]; int X[3] [4];

import java.util.* ; public class Averager { public static void main(String[] args) { //a two dimensional array int[][] a = {{5, 9, 3, 2, 14}, {77, 44, 22, 15, 99}, {14, 2, 3, 9, 5}, {88, 15, 17, 121, 33}} ; System.out.printf("Average = %.2f\n", average(a)) ; System.out.println("EXPECTED:") ; System.out.println("Average = 29.85") ; System.out.printf("Average of evens = %.2f\n", averageEvens(a)) ; System.out.println("EXPECTED:") ; System.out.println("Average of evens = 26.57") ; Random random = new Random(1) ; a = new int[100][1] ; for (int i = 0 ; i < 100 ; i++) a[i][0] = random.nextInt(1000) ; System.out.println("For an array of random values in range 0 to 999:") ; System.out.printf("Average = %.2f\n", average(a)) ; System.out.printf("Average of evens = %.2f\n", averageEvens(a)) ; } /** Find the average of all elements of a two-dimensional array @param aa the two...