Count number of occurrence of a digit in two array in java -

need find smallest , largest in 2 array , number of occurrence of 2 digits in 2 array.

package assignment; import java.util.scanner;  public class arraytester {     public static double counts (int[] sampled, int val) {         int count = 0;          (int = 0; < sampled.length; i++) {             if (sampled[i] == val) {                 count++;             }         }          return count;     }      public static void main(string[] args) {         int[] numbers1;         int[] numbers2;         numbers1 = new int[5];         numbers2 = new int[5];         int smallest , largest , array_number1, array_number2;         int smallest1 = numbers1[0], largest1 = numbers1[0];         int smallest2 = numbers2[0], largest2 = numbers2[0];          // create scanner object         scanner input = new scanner(system.in);          system.out.print("please enter 5 numbers: \n");          (int counter = 0; counter < numbers1.length; counter++) {             numbers1[counter] = input.nextint();         }          // finding smallest , largest value in 1st array               (int : numbers1) {                         if (i < smallest1) {                 smallest1 = i;             }              else if (i > largest1) {                 largest1 = i;             }          }           system.out.print("please enter 5 numbers: \n");         (int counter = 0; counter < numbers2.length; counter++) {             numbers2[counter] = input.nextint();         }          // finding smallest , largest value in 2nd array            (int : numbers2) {                         if (i < smallest2) {                 smallest2 = i;             } // end finding smallest             else if (i > largest2) {                 largest2 = i;             }  // end finding largest number          }          // finding smallest , largest value of both array.## heading ##             if (smallest1 < smallest2) {             smallest=smallest1;             array_number1 = 1;         } else {             smallest=smallest2;             array_number1 = 2;         }          if (largest1 > largest2) {             largest = largest1;             array_number2 = 1;         } else {             largest = largest2;             array_number2 = 2;         }          system.out.printf("smallest number: %d \t %d \nlargest number: %d \t %d \n", smallest,array_number1, largest, array_number2);     } }     

explain how count of smallest , largest value 2 array.

the following code want:

   public static void main(string[] args) {         int[] numbers1;         int[] numbers2;         numbers1 = new int[5];         numbers2 = new int[5];         int smallest , largest , array_number1, array_number2;         int smallestoccurence = 0, largestoccurence = 0;         // create scanner object         scanner input = new scanner(system.in);          system.out.print("please enter 5 numbers: \n");          (int counter = 0; counter < numbers1.length; counter++) {             numbers1[counter] = input.nextint();         }         int smallest1 = numbers1[0], largest1 = numbers1[0];         // finding smallest , largest value in 1st array         (int : numbers1) {             if (i < smallest1) {                 smallest1 = i;             }             else if (i > largest1) {                 largest1 = i;             }         }          system.out.print("please enter 5 numbers: \n");         (int counter = 0; counter < numbers2.length; counter++) {             numbers2[counter] = input.nextint();         }         int smallest2 = numbers2[0], largest2 = numbers2[0];          // finding smallest , largest value in 2nd array         (int : numbers2) {             if (i < smallest2) {                 smallest2 = i;             } // end finding smallest             else if (i > largest2) {                 largest2 = i;             }  // end finding largest number         }         // finding smallest , largest value of both array.## heading ##         if(smallest1 < smallest2){             smallest=smallest1;             array_number1 = 1;         } else {             smallest=smallest2;             array_number1 = 2;         }          if(largest1 > largest2){             largest=largest1;             array_number2 = 1;         } else {             largest=largest2;             array_number2 = 2;         }          system.out.printf("smallest number: %d \t %d \nlargest number: %d \t %d \n", smallest, array_number1, largest, array_number2);         // dont know smallest , largest until traverse arrays atleast once. once know them need search them in array again.         for(int item : numbers1) {             if(item == smallest) smallestoccurence++;             if(item == largest) largestoccurence++;         }         for(int item : numbers2) {             if(item == smallest) smallestoccurence++;             if(item == largest) largestoccurence++;         }         system.out.println("occurences of smallest: " + smallest + " , largest: " + largestoccurence);      }     public static double counts (int[] sampled, int val)     {         int count = 0;         (int = 0; < sampled.length; i++) {             if (sampled[i] == val) {                 count++;             }         }         return count;     } 

explanation: need traverse both arrays @ least once find smallest , largest among arrays. once find smallest , largest need traverse both arrays again find number of occurrences. need move declaration of smallest1 etc. else value 0 (default array element) , smallest (until negative numbers stored).

sample run:

please enter 5 numbers: 5 5 4 3 1 please enter 5 numbers: 5 5 2 3 1 smallest number: 1 2 largest number: 5 2 occurences of smallest: 1 , largest: 4