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 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65
|
#include "ed/inc/prt.h"
#include <assert.h>
#include <stddef.h>
size_t dicosearch (int *T, size_t size, int v)
{
if (T == NULL || size == 0)
return (size_t) - 1;
size_t hi = size - 1;
size_t lo = 0;
size_t mid = (hi + lo) / 2;
while (mid < size && lo <= hi)
{
assert (mid < size);
if (v < T[mid])
hi = mid - 1;
else if (v > T[mid])
lo = mid + 1;
else
return mid;
mid = (hi + lo) / 2;
}
return (size_t) - 1;
}
#ifdef TEST
#include <stdio.h>
#include <assert.h>
int main (void)
{
assert (dicosearch (NULL, 1, 1) == (size_t) - 1);
assert (dicosearch (1, 0, 1) == (size_t) - 1);
#define N(a) (sizeof(a)/sizeof*(a))
{
int a[] = { 1 };
assert (dicosearch (a, N (a), 1) == 0);
assert (dicosearch (a, N (a), 0) == (size_t) - 1);
assert (dicosearch (a, N (a), -1) == (size_t) - 1);
}
{
int a[] = { 1, 2 };
assert (dicosearch (a, N (a), 1) == 0);
assert (dicosearch (a, N (a), 2) == 1);
assert (dicosearch (a, N (a), 0) == (size_t) - 1);
assert (dicosearch (a, N (a), -1) == (size_t) - 1);
}
{
int a[] = { 1, 2, 3 };
assert (dicosearch (a, N (a), 1) == 0);
assert (dicosearch (a, N (a), 2) == 1);
assert (dicosearch (a, N (a), 3) == 2);
assert (dicosearch (a, N (a), 0) == (size_t) - 1);
assert (dicosearch (a, N (a), -1) == (size_t) - 1);
}
puts ("P A S S E D");
return 0;
}
#endif |
Partager