comp/work/35/binaryseach.c


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44

#include <stdio.h>
#include <stdbool.h>
#include <stdlib.h>
#include <string.h>

char *arr[] = {
	"ali",
	"ben",
	"carl",
	"joe",
	"ken",
	"lara",
	"mo",
	"oli",
	"pam",
	"stan",
	"tara"
};
int len = 11;

char *binsearch(char *tofind){
	int l = len/2;
	char *start = arr[0];
	char *end = arr[len];
	char *mid = arr[l];

	while (mid != tofind){
		if (strcmp(mid, tofind) < 0){
			start = mid;
			l /= 2;
			mid = arr[len - l];
		}else {
			end = mid;
			l /= 2;
			mid = arr[len - l]
		}
	}

	return start;
}

int main(){
	binsearch("pam");
}