Курсовая работа1 / Bin / Tests / BS

// binary search

int find(int arr[], int count, int value)
{
	int l, r, c = 0;
	l = 0;
	r = count - 1;
	while (l <= r)
	{
		c = (l + r) >> 1;
		if (arr[c] < value)
			l = c + 1;
		else if (arr[c] > value)
			r = c - 1;
		else
			return c;
	}
	return count + 1;
}

int main()
{
  int a[100];
  int i;
  for (i = 0; i < 100; i++)
    a[i] = i + 1;
  putn(find(&a, 100, 3));
}