Does the following c program use a divide and conquer algorithim to find the max profit
if it doesn't change it so there is a divide an conquer algorithim

#include
#include

// Function to find the maximum profit within a subarray
int maxProfit(int arr[], int low, int high) {
if (low >= high)
return 0;

int maxProfit = 0;

// Nested for loops to find the maximum profit
for (int i = low; i <= high; i++) {
int buyPrice = arr[i];
for (int j = i + 1; j <= high; j++) {
int sellPrice = arr[j];
int currentProfit = sellPrice - buyPrice;
if (currentProfit > maxProfit) {
maxProfit = currentProfit;
}
}
}

return maxProfit;
}

int main() {
// Read input from a file (assuming input.txt contains the array of prices)
FILE *file = fopen("input.txt", "r");
if (file == NULL) {
perror("Error opening file");
return 1;
}

int n;
fscanf(file, "%d", &n);

int *prices = (int *)malloc(n * sizeof(int));
for (int i = 0; i < n; i++) {
fscanf(file, "%d", &prices[i]);
}
fclose(file);

int max_profit = maxProfit(prices, 0, n - 1);

// Print the result
printf("The optimal solution for input.txt is %d.\n", max_profit);

free(prices);
return 0;
}