The problem is as follows, and it does not have to be a fullyworking program rat

Question

The problem is as follows, and it does not have to be a fullyworking program rather just a recursive method: Suppose thatintArray is an Array of integers and length specifies the number ofelements in intArray. Also, suppose that low and high are twointegers such that 0<=low<length, 0<=high<length andlow < high. That is, low and high are two indices in intArray.Write a recursive definition that reverses the elements in intArraybetween low and high. ------ This is not for school, as I am tryingto learn java on my own, so any help would be appreciated. The problem is as follows, and it does not have to be a fullyworking program rather just a recursive method: Suppose thatintArray is an Array of integers and length specifies the number ofelements in intArray. Also, suppose that low and high are twointegers such that 0<=low<length, 0<=high<length andlow < high. That is, low and high are two indices in intArray.Write a recursive definition that reverses the elements in intArraybetween low and high. ------ This is not for school, as I am tryingto learn java on my own, so any help would be appreciated.

Explanation / Answer

please rate - thanks import java.util.*; public class recursivereversearray {public static void main(String [] args)     { int[]array={5,4,7,9,2,99,7,9,2,15};    System.out.println("Before:");       for(int i=0;i

Related Questions

Navigate

• Browse (All)
• Browse T
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.