Rava/11_ArrayOperations.java at 253b87c9ae2f370524a8559329252191732d3f09

 public class ArrayOperations {
     public static int sumArray(int[] arr, int length) {
         int sum = 0;
         int i = 0;
         while (i < length) {
             sum = sum + arr[i];
             i = i + 1;
         }
         return sum;
     }
     public static int findMax(int[] arr, int length) {
         int max = arr[0];
         int i = 1;
         while (i < length) {
             if (arr[i] > max) {
                 max = arr[i];
             }
             i = i + 1;
         }
         return max;
     }
     public static int findMin(int[] arr, int length) {
         int min = arr[0];
         int i = 1;
         while (i < length) {
             if (arr[i] < min) {
                 min = arr[i];
             }
             i = i + 1;
         }
         return min;
     }
     public static int main() {
         int[] numbers = new int[5];
         numbers[0] = 10;
         numbers[1] = 25;
         numbers[2] = 5;
         numbers[3] = 30;
         numbers[4] = 15;
         int sum = sumArray(numbers, 5);
         System.out.println(sum);
         int max = findMax(numbers, 5);
         System.out.println(max);
         int min = findMin(numbers, 5);
         System.out.println(min);
         int[] squares = new int[5];
         int i = 0;
         while (i < 5) {
             squares[i] = (i + 1) * (i + 1);
             i = i + 1;
         }
         System.out.println(squares[0]);
         System.out.println(squares[1]);
         System.out.println(squares[2]);
         System.out.println(squares[3]);
         System.out.println(squares[4]);
         return 0;
     }
 }