Week 9: Tuesday
---------------

Q1. (40)

Input two strings s and t from the user.  Assume that the strings do not
contain blank or any whitespace character.

Write a function that finds the first occurrence of t in s.  The function
should return the index in s or -1 if t is not found.

The parameters of the function find contains only pointers to characters (not
arrays):
	int find(char *s, char *t)

Avoid using notations of the form *(s + i) that simulates s[i].

Q2. (60 using recursion, 50 not using recursion)

Write a program that inputs a line of characters from the user.  The line may
contain blanks.  (Use gets.)

Write a function that outputs the line (use puts) with the words reversed.  The
characters in the word should not be reversed.

For example, if the input is
This is hard
the output should be
hard is This

Try doing it by recursion.  If you cannot, use a non-recursive function (you
lose 10% marks).