How can express this imperative function in a functional, array-based language like K (or Q)?

In sloppy C++:

vector<int> x(10), y(10); // Assume these are initialized with some values.

// BTW, 4 is just a const -- it's part of the algorithm and is arbitrarily chosen.

vector<int> result1(x.size() - 4 + 1); // A place to hold a resulting array.
vector<int> result2(x.size() - 4 + 1); // A place to hold another resulting array.

// Here's the code I want to express functionally.
for (int i = 0; i <= x.size() - 4; i++) {
    int best = x[i + 0] - y[i + 0];
    int bad = best;
    int worst = best;
    for(int j = 0; j < 4; j++) {
        int tmp = x[i + j] - y[i + 0];
        bad = min(bad, tmp);
        if(tmp > best) {
            best = tmp;
            worst = bad;
        }
    }
    result1[i] = best
    result2[i] = worst
}

I would most like to see this in kdb and Q but other functional languages are welcome.

Solution

In Kona (an open-source K dialect):

First, set some example values (using same as the Clojure solution):

a:1+!8;b:8#0        / a is 1..8, b is eight 0s

Then:

{(|/x;&/x)}@+{4#y _ x}[a+b;]'!#a

Where a and b are your x and y variables above. (K makes a special case for the variables x, y, and z.)

To break that up a bit more:

maxmin:{(|/x;&/x)}  / (max;min) pairs of x
get4:{4#y _ x}      / next 4 from x, starting at y
                    / with <4 remaining, will repeat; doesn't matter for min or max
/ maxmin applied to flipped results of get4(a-b) at each index 0..(length a)-1
maxmin@+get4[a-b;]'!#a

/ result
(4 5 6 7 8 8 8 8
 1 2 3 4 5 6 7 8)