Algorithms

2 3  =>  3 4  =>  4 2
1 4      1 2      1 3

2 3 5  =>  3 5 6  =>  5 6 4  =>  6 4 2  =>  4 2 3
1 4 6      1 2 4      1 3 2      1 5 3      1 6 5

Hair color
Brown   Blond
1 2 3   7  8  9
4 5 6  10 11 12

Rotate()

Hair color
Brown   Blond
1 3 7   8  9 12
2 4 5   6 10 11

Hair color
Brown   Blond
1 3 6   8  9 12
2 4 5   7 10 11

Eye color
Brown    Blue
4  6  7  1 2  3
8 10 12  5 9 11

Input Parameters: p, t
Output Parameters: None

mc_rabin_karp_search(p, t) 
{
      m = p.length
      n = t.length
      q = randomly chosen prime number less than mn2
      r = 2m−1 mod q

      // computation of initial remainders
      f[0] = 0
      pfinger = 0
      for j = 0 to m-1 
      {
            f[0] = 2 * f[0] + t[j] mod q
            pfinger = 2 * pfinger + p[j] mod q
      }

      i = 0
      while (i + m ≤ n) 
      {
            if (f[i] == pfinger)
                  prinln("Match at position" + i)

            f[i + 1] = 2 * (f[i]- r * t[i]) + t[i + m] mod q
            i = i + 1
      }
} 

Angelinna wrote:

but am after a working example not just a pseudocode

Angelinna wrote:

am after a working example not just a pseudocode

abhigad wrote:

So the length of this array is 4 [i.e. n=4] since C# array index starts at 0

int[] in = new int[] {...}
int[] out = new int[in.Length];
Array.Copy(in (k -> length) => out (0 ...));
Array.Copy(in (0 -> k) => out (length - k));