Algorithm

To find the maximum difference between two elements in an array where the larger element appears after the smaller one, we can use a straightforward brute-force approach with two nested loops.

The outer loop selects each element of the array one by one, while the inner loop compares it with all the elements that come after it. For each pair, we calculate the difference and check if it is greater than the maximum difference found so far.

If it is, we update our result. After checking all possible pairs, the maximum recorded difference is returned as the final answer.

Code

#include <bits/stdc++.h>
using namespace std;

class Solution {
public:
    // Function to find maximum difference with order
    int maxDifference(vector<int>& arr) {
        int n = arr.size();
        int maxDiff = INT_MIN;

        // Outer loop to pick each element
        for (int i = 0; i < n; i++) {
            // Inner loop to compare with elements ahead
            for (int j = i + 1; j < n; j++) {
                // Calculate difference
                int diff = arr[j] - arr[i];

                // Update max difference
                if (diff > maxDiff) {
                    maxDiff = diff;
                }
            }
        }

        return maxDiff;
    }
};

int main() {
    vector<int> arr = {2, 3, 10, 6, 4, 8, 1};
    Solution obj;
    cout << obj.maxDifference(arr);
    return 0;
}