冒泡法排序，最后一个数组不住到为什么变成0

Question

void ascorder_start_worktime()
{
    int i, j=0;
    for (i = 0; i < n-1; i++)
    {
        for (j =i+1; j < n-1; j++)
        {
            if(strcmp(sta[i].start_worktime,sta[j].start_worktime)>0)
            {
                temp = sta[i]; sta[i] = sta[j]; sta[j] = temp;
            }
        }
    }
    for (i = 0; i <n; i++)
    {
        printf("%ld %s %s %d %s %s\n", sta[i].num, sta[i].name, sta[i].sex, sta[i].age, sta[i].start_worktime, sta[i].phone_num);
    }
}

Answer 1

1
这是选择排序
2
j<n