[Hamed]

I know this code for binary search

Code:

int search(int a[], int key, int low, int high) {
    if (high < low) {
        return NOT_FOUND; 
    }
    int mid = (low + high) / 2;
    if (key>a[mid]) {
        return searchName(a, key,low, mid-1);
    } else if (key<a[mid]) {
        return searchName(a, key,mid+1, high);
    } else {
        return EXIT_SUCCESS; 
    }
    return ERROR_SEARCH;
}

Now I want to make recursive one which just need
int search(char *dict, char *name,int length,int compChars)
and length is number element in array.
please help me.

[Hamed]

[PHP]

PHP Code:

int bs(int array[],int n,int key)

{

    int mid,low=0,high=(n-1);

    mid=n/2;

    printf("high:%d--low:%d\n",high,low);

    if(array[mid] == key)

    {

        return(mid);

    }

    if(array[mid]>key)

    { 

         printf("mid>key\t");printf("array[mid]=%d--mid=%d\n",array[mid],mid);

        return(bs(&(array[0]),mid,key));

    }

    if(array[mid]<key)

    {

                      printf("mid<key\n");printf("array[mid]=%d--mid=%d\n",array[mid],mid);

        return(bs(&(array[mid+1]),mid,key));

    }

    if(high < low)

    {

         return(-1);

    }

    else{

         return(-1);

    }

} 

This one work for all exit element but there is not condition to stop when element now exit!??
Please test it and help.I really need it before next midnight.

[mkcitizen]

Thanks for this coding if any doubts ask me i am here to help u friends