Binary_Search
123456789101112131415161718192021222324252627
#include <stdio.h>
/*
Deus ta vendo!
x = Numero a ser pesquisado n = tamanho do vetor
e = esquerda d = direita
*/
int BinarySearch(int x, int n, int vet[]){
int e,m,d;
e = -1; d = n;
while(e < d-1){
m = (e+d)/2;
if(vet[m] < x) e = m;
else d = m;
}
return d;
}
int main(void) {
int vet[11] = {0,2,4,6,8,10,12,14,16,18,20};
printf("%d",BinarySearch(6,10,vet));
return 0;
}
C
INFO