晒晒我写的折半插入排序算法

#include <stdio.h>
void sort(char str[], int n)
{
    int i, j, temp,low,high,mid;
    for(i=1; i<n; i++)
    {
        temp=str[i];
        for(low=0,high=i-1;low<=high;)
        {
            mid=(low+high)/2;
            if(temp<str[mid])
                high=mid-1;
            else
                low=mid+1;
        }
        for(j=i-1; j>=low; j--)
            str[j+1]=str[j];
        str[low]=temp;
    }
}
void print(char str[], int n)
{
    int i;
    for(i=0; i<n; i++)
        printf("%d ",str[i]);
}
int main()
{
    char str[7]={67, 53, 73, 21, 34, 98, 12};
    sort(str, 7);
    printf("sorted array is:\n");
    print(str, 7);
    return 0;
}