bsearch lab 14

#include <stdio.h>
#include <stdlib.h>

int cmpDescrescator(const void *a, const void *b)
{
    int va=*(int*)a, vb=*(int*)b;
    if(va<vb) return 1;
    if(va>vb) return -1;
    return 0;
}

int main()
{
    int *v,n,x,i;
    printf("n = "); scanf("%d",&n);
    printf("x = "); scanf("%d",&x);

    v=malloc(n*sizeof(int));
    for(i=0; i<n; i++) scanf("%d",&v[i]);
    qsort(v,n,sizeof(int),cmpDescrescator);

    int *p;
    p=bsearch(&x,v,n,sizeof(int),cmpDescrescator);
    if(p) printf("%d e pe pozitia %d",*p,p-v+1);
    else printf("nu-i");

    free(v);
    return 0;
}