#include <string.h>
#include "key.h"

struct key *
bsearch(char *word, struct key tab[], int n)
{
	int cond;
	struct key *low, *high, *mid;

	low = tab;
	high = tab + n - 1;
	while (low <= high) {
		mid = low + (high-low) / 2;
		if ((cond = strcmp(word, mid->word)) < 0)
			high = mid - 1;
		else if (cond > 0)
			low = mid + 1;
		else 
			return mid;
	}

	return NULL;
}