Given an array A, find the maxium difference, D = A[j] - A[i] such that j >= i

maxdiff.d

import std.stdio;
import std.algorithm;

auto maxDiff(T)(T[] array) {
    T m = 0, minVal = array[0];
    foreach (i; 1 .. array.length) {
        auto diff = array[i] - minVal;
        m = max(m, diff);
        minVal = min(minVal, array[i]);
    }
    return m;
}

void main() {
    auto array = [15,2,5,3,10,7,-4];
    writeln(maxDiff(array));
}