OOP-JAVA Practical 22

• PPS(C)
• JAvA

• Aim: Write a recursive method that returns the smallest integer in an array. Write a test program that prompts the user to enter an integer and display its product.
• Code:

  import java.util.Scanner;
  public class practical22 {
      public static void main(String[] args) {
          int product=1;
          Scanner s=new Scanner(System.in);
          System.out.println("Enter the length of array");
          int length=s.nextInt();
          int a[]=new int[length];
          System.out.println("Enter elements in array");
          for(int i=0;i<length;i++){
              a[i]=s.nextInt();
              product*=a[i];
          }
          int m= minvalue(a,length);
          System.out.println("Smallest integer in array: "+m);
          s.close();
          System.out.println("Product of integers in array: "+product);
      }
      private static int minvalue(int x[],int n) {
          if (n==1) {
              return x[0];
          } else {
              return Math.min(x[n-1], minvalue(x, n-1));
          }
      }
  }

• Output:
  

Practical 21 Practical 23