Question

Repeat the assignment "don't be so negative" except solve the problem using recursion. Specifically, create an array of 10 random integers between -10 and +10 then create a method say "findNegatives" that takes as input parameters the array, and possibly other parameters, then calls itself (direct recursion); method find Negatives( ...method parameters here...) ...some stopping criteria... find Negatives(...method parameters here...) Output: Array position #0 #1 Value 10 7 -3 (Negative!) #3 #4 -8 (Negative) #5 10 #7 mimi -7 (Negative!)

last question : Don't be negative

and source Code : of don't be negative

Answer 1

saved OpenJDK Runtime Environment (build 10.0.2+13-Ubuntu-lubuntu0.12.0 Main.java 3 1 class Main { ? javac -classpath ./run dir/junit-4.12.jar -d . Main.java ? java -classpath ../run_dir/junit-4.12.jar Main Array Positon Value #0 10 # قا في # -5 (Negative!) # نيا # ر public static void findNegatives (int[] arr, int start, int end) { //base condition to exit the recursion if(start >= end) { return; }else{ if(arr[start] >= 0) System.out.printf("\n#%d %d",start, arr [start]); else System.out.printf("\n#%d %d (Negative!)", start, arr[start]); //recursive call start++; findNegatives (arr, start, end); # ا ( -1 (Negative!) -6 (Negative!) # # - # E -8 (Negative!) # ما public static void main(String[] args) { int[] intArray = new int[10]; for(int i=0; i<10; i++){ double x = (Math.random() * ((10-(-10) +1))+(-10)); intArray[i] = (int)x; System.out.println("\nArray Positon Value"); findNegatives(intArray, o, intArray.length);

code:

class Main {

public static void findNegatives(int[] arr,int start,int end){

//base condition to exit the recursion

if(start >= end){

return;

}else{

if(arr[start] >= 0)

System.out.printf("\n#%d %d",start,arr[start]);

else

System.out.printf("\n#%d %d (Negative!)",start,arr[start]);

//recursive call

start++;

findNegatives(arr, start, end);

}

}

public static void main(String[] args) {

int[] intArray = new int[10];

for(int i=0;i<10;i++){

double x = (Math.random() * ((10-(-10) +1))+(-10));

intArray[i] = (int)x;

}

System.out.println("\nArray Positon Value");

findNegatives(intArray, 0, intArray.length);

}

}