Select prime number from the list of given numbers, add them except the smallest prime number?

Question

Array: 2,5,8,9,6,7,11,13,15,16,18,19,31,33,37,45

OUTPUT

2 is a prime number in the array 
5 is a prime number in the array 
7 is a prime number in the array 
11 is a prime number in the array 
13 is a prime number in the array 
19 is a prime number in the array 
31 is a prime number in the array 
37 is a prime number in the array 
Min 2
Sum 123

Answer 1

  int[] arr = new int[]{2,5,8,9,6,7,11,13,15,16,18,19,31,33,37,45};
  int val=0,sum=0;
  int min = arr[0];

  for(int i=0;i<arr.length;i++){
  boolean isPrime = true;
  if(arr[i]==1){
  isPrime = false;
  }
  else{
  for(int j=2;j<arr[i]/2;j++){
  if(arr[i]%j==0){
  isPrime=false;
  break;
  }
  }
  }

  if(isPrime){
  System.out.println(arr[i] + " is a prime number in the array ");
  for(int l=0;l<arr.length;l++){
  if(min>arr[l]){
  min=arr[l];
  System.out.println("Min "+min);
  }
  }
  val=val+arr[i];
  }
  }
  System.out.println("Min "+min);
  sum = val-min;
  System.out.println("Sum "+sum);

Comments

pls give this code in c language