// Search[] is the array of values to search for
// Target[] is the array to search in for Search[]
// Max is the upper bound of Target[]
// N is the upper bound of Search[]
// Search[] and Target[] have a lower bound of 0
// Found is a flag stating if a match is found
// Pos is the position of the first occurence of Search[] in Target[]
// I and E are integer variables
// Search[] contains at least 1 element

Found = 0; // Loop through target array
for (I = 0; I <= Max; I++) {
    // If the first value matches
    if (Target[I] == Search[0]) {
        Found = 1; // Set up a flag variable

        // Check for the remainder of the search values
        for (E = 1; E <= N; E++) {
            // Check for upper bound
            if (I + E > Max) {
                I = -1;
                break;
            }

            // Check for value mismatch
            if (Target[I + E] != Search[E]) {
                Found = 0;
                break;
            }
        }
    }

    // End loop if match is found
    if (Found == 1) break;
}

// Finalize position value
if (Found == 1)
    Pos = I;
else
    Pos = -1;

// Return the value
return Pos;