Sort - busca binaria

#include <stdio.h>

int BuscaBinária (int x, int n, int v[]) {
  int e, m, d;
  e = -1; d = n;
  while (e < d - 1) {
    m = (e + d)/2;
    if (v[m] < x) e = m;
    else d = m;
  }
  return d;
}

int main(void){
    
    int vet[5] = {10, 20, 30, 40, 50};
    printf("%d",BuscaBinária(45,10,vet));
    return 0;
}

C

INFO