我在对顺序表进行折半插入排序，为什么什么都输出不了

Question

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

#define MAXSIZE 10

/**
 * @brief 
 * 顺序表的存储结构
 */
typedef struct SQList
{
    int *data;
    int length;
} SQList;

SQList InitList()
{ //初始化线性表
    SQList L;
    L.data = (int *)malloc(MAXSIZE * sizeof(int));
    if (!(L.data))
    {
        printf("初始化失败");
    }
    L.length = 0;
    return L;
}

void BInsertSort(SQList L)
{
    int i, j, low = 0, high = 0, mid;
    for (i = 1; i < L.length; i++)
    {
        low = 0;
        high = i - 1;
        int temp = 0;
        while (low <= high)
        {
            mid = (low + high) / 2;
            if (L.data[i] < L.data[mid])
            {
                high = mid - 1;
            }
            else
            {
                low = mid + 1;
            }
        }
        for (j = i; j > low; j--)
        {
            L.data[j] = L.data[j - 1];
        }
        L.data[low] = temp;
    }
}

int main()
{
    SQList L = InitList();
    for (int i = 0; i <= 10; i++)
    {
        L.data[i] = 10 - i;
        L.length++;   
    }
    BInsertSort(L);
    for (int j = 0; j < L.length; j++)
    {
        printf("%d\n", L.data[j]);
    }
    return 0;
}

Answer 1

14行temp=0是想干啥
59行应该是越界了，最好还是改成<