Flexible Array - Algorithm

Here's your approach for dynamic arrays:

$1.$ Read $n$, the number of elements needed.

$2.$ Allocate an array: int* arr = new int[n];

$3.$ Read or compute values into arr[0] through arr[n-1].

$4.$ Process the array as needed (sum, search, transform).

$5.$ Output results.

$6.$ Free the memory: delete[] arr;

$7.$ Set pointer to nullptr to prevent accidental reuse. The delete[] must come after all array usage is complete but before the function ends.