int find_word(FILE* fp, char search[])
{
	int		index = 0;
	char	read;

	do{
		read=fgetc(fp);
		if(read == search[index])
			index++;	//Go to next search letter
		else
			index = 0;	//Mismatch - start over
		if(search[index] == 0)  //If the index is at the end of the search string it is a match
			break;		//Exit loop upon success.
	}while(read!=EOF);
	if(search[index] == 0)
		return 1;		//Found the word
	else
		return 0;		//Never found it.
}



//This function is identical to find_word, but will also stop searching at
//the end of the table.  A better implementation would be to make another parameter
//for the "stop" string.
int find_table_word(FILE* fp, char search[])
{
	int		index = 0;
	char	read;
	char	stop[]="/table";
	int		stop_index = 0;


	do{
		read=fgetc(fp);
		if(read == stop[stop_index])
			stop_index++;
		else
			stop_index=0;
		if(read == search[index])
			index++;
		else
			index = 0;
		if(search[index] == 0)
			break;
		if(stop[stop_index]==0)
			break;
	}while(read!=EOF);
	if(search[index] == 0)
		return 1;
	else
		return 0;
}


char* read_until(FILE* fp, char tag)
{
	char* 	string = (char*) malloc(50);
	//This is a weak implementation.  Big opportunity for segfault here.
	//This should be changed to dynamically change memory allocation.
	char*	pos;
	char	cread;

	pos = string;
	while( (cread = fgetc(fp) ) != tag){
		*pos = cread;
		pos++;
	}
	*pos = 0;					//Terminate string
	fseek(fp,-1,SEEK_CUR);		//Backup file position by one

	return string;
}

   while(find_word(file,"<a href=\"")){
       link[x] = read_until(file,'"');
       find_word(file,">");
       name[x] = read_until(file,'<');
       x++;
    }