public class ArrayOperations {
    public static int sumArray(int[] arr) {
        int sum = 0;
        int i = 0;
        while (i < arr.length) {
            sum = sum + arr[i];
            i = i + 1;
        }
        return sum;
    }

    public static int findMax(int[] arr) {
        if (arr.length == 0) {
            return 0;
        }
        int max = arr[0];
        int i = 1;
        while (i < arr.length) {
            if (arr[i] > max) {
                max = arr[i];
            }
            i = i + 1;
        }
        return max;
    }

    public static int main() {
        int[] numbers = new int[5];
        numbers[0] = 10;
        numbers[1] = 25;
        numbers[2] = 15;
        numbers[3] = 30;
        numbers[4] = 20;

        System.out.println(sumArray(numbers));
        System.out.println(findMax(numbers));

        int[] fibonacci = new int[10];
        fibonacci[0] = 0;
        fibonacci[1] = 1;
        int i = 2;
        while (i < 10) {
            fibonacci[i] = fibonacci[i - 1] + fibonacci[i - 2];
            i = i + 1;
        }

        i = 0;
        while (i < 10) {
            System.out.println(fibonacci[i]);
            i = i + 1;
        }

        return 0;
    }
}