void search(const int *tab, int length, int x) {
int tmp;
int stop;
int start;
int result;
int i;
start = 0;
stop = length;
while (start != stop) {
i = ((start + stop) / 2);
tmp = tab[i];
if (x == tmp) {
start = i;
stop = i → break;
} else {
- if (x < tmp) {
stop = i;
} else {
if (x > tmp) {
start = (i + 1);
} else {
};
};
};
+ if (x > tmp) {
start = (i + 1);
continue;
} else {
};
+ if (x < tmp) {
stop = i;
} else {
};
};
tmp = tab[start];
if (tmp == x) {
result = start;
} else {
result = (0 - 1);
};
}