Recursive Array Manipulation in Java

Description

This project implements a set of recursive functions for array manipulation in Java. The functions perform operations such as summing the elements of an array, finding the largest element, and summing the elements of subarrays.

Function Structure

1. f01(int[] array, int selecao)

• Recursively sums the elements of the array starting from the specified index selecao.

2. f02(int[] array, int posicao)

• Finds the largest element in the array using recursion.

3. f03(int[] array)

• Recursively sums the elements of the array by dividing it into subarrays and summing the results of each subarray.

4. nomesDasFuncoes()

• Returns an array of strings with descriptive names for the implemented functions.

How to Use

1. Clone the repository.
2. Compile and execute the Main.java class.
3. Call the functions as needed within the main method or other classes.

Requirements

• Java 8 or higher

Author

Developed by Gonçalo Gonçalves.