Google Algorithm Exercise.

[Seabook]

1) Given a function which produces a random integer in the range 1 to 5, write a function which produces a random integer in the range 1 to 7.

2) Write a function f(a, b) which takes two character string arguments and returns a string containing only the characters found in both strings in the order of a. Write a version which is order N-squared and one which is order N.

Happy Coding.

Thanks,
Seabook

[Huanwen Qu]

The first one is easy. Generate seven random number and sumerize them,
then divide five.


don't Understand the second one.

[Seabook]

The first one could construct a matrix like this
{
1,2,3,4,5,
6,7,1,2,3,
4,5,6,7,1,
2,3,4,5,6,
7,0,0,0,0
}

int x = random(5) - 1;
int y = random(5) - 1;


return matrix[x][y] == 0? recursive : matrix[x][y];

[Huanwen Qu]

Not sure if this will produce perfect result.

My solution is much easier.

return round((rand5()+rand5()+rand5()+rand5()+rand5()+rand5()
+rand5())/
5);