The object is to find words formed in the grid by contiguous sequences of letters. Letters are considered to be touching if they are horizontally,...

The object is to find words formed in the grid by contiguous sequences of letters. Letters are considered to be touching if they are horizontally, vertically, or diagonally adjacent. For example, the board:

Q W E R T

A S D F G

Z X C V B

Y U A O P

G H J K L

contains the magic words WAS, WAXY, JOB.

I have the grid but need help coding the user interface to find the words in the grid similar to above example.

x; y; grid [] []; z; j; { alphabet[] = { , , , , , , ,, , , , , , ,, , , , , , ,, , , , }; (); (, &x, &y); (z = ; z < x; z++) { (j=; j < y; j++){grid [z] [j] = alphabet[rand() % ];}} (z = ; z < x; z++) { (j=; j < y; j++){ (, grid [z] [j]);} ();}}