冒泡排序+二分法查找

#include <stdio.h>

void bubble(int *arr, int length)
{
    int i, j, tmp;
    for(i=0;i<length-1;i++)
    {
        for(j=0;j<length-1-i;j++)
        {
            if(arr[j]>arr[j+1])
            {
                tmp = arr[j];
                arr[j] = arr[j+1];
                arr[j+1] = tmp;
            }
        }
    }

}

int search(int *arr, int key, int high, int low)
{
    int middle = 0;
    if(high<low)
        return -1; 
    middle = (low+high)/2;
    printf("hello\n");
    if(arr[middle] == key)
    {   
        return middle;
    }   
    else if(arr[middle]<key)
        return search(arr, key, high, middle+1);
    }
    else
    {
        return search(arr, key, middle-1, low);
    }
}

int main()
{
    int i = 0;
    int a[] = {1, 32, 5, 56, 39, 4, 67, 83, 25, 98};
    
    for(i=0;i<10;i++)
    {   
        printf("%d\t", a[i]);
    }
    printf("\n");
    bubble(a, 10);
    i = search(a, 32, 9, 0);
    printf("i=%d\n", i);
    for(i=0;i<10;i++)
    {   
        printf("%d\t", a[i]);
    }
    printf("\n");
    return 0;
}