Завершите приведенный ниже исходный код, чтобы создать программу, которая печатает первую строку в лексикографическом порядке.

Question

Это проблема.сравнить две строки в перспективе лексикографического порядка.>

Я ожидал, что Истина, но Ложь.

int main(void)
{
    char* pcolor[] = {"red", "orange", "yellow", "green", "blue",  "indigo", "violet", "purple", "white", "ivory", "gray", "black", "cyan", "pink", NULL};

    char* pt = pcolor[0], * pbegin = pcolor[0], * min = NULL, * temp = NULL;
    char min_c[2] = "1", pbegin_c[2] = "1";
    int i, j, k = 1, imin;

    for (pt = pcolor[0], i = 0; pt != NULL; pt = pt + strlen(pcolor[i++]) + 1)
    {
        printf("%s\n", pt);// == puts(pt);
    }

    for (i = 0; pt != NULL; i++)
    {
        pt = pcolor[i];
        imin = i;
        min = pt;

        for (j = i; pbegin != NULL; j++)
        {
            pbegin = pcolor[j];

            if (min == pbegin)
            {
                pbegin = pcolor[j++];
                continue;
            }

            strncpy(min_c, min, sizeof(min_c) - 1);
            strncpy(pbegin_c, pbegin, sizeof(pbegin_c) - 1);

            if (strcmp(min_c, pbegin_c) == 1)
            {
                min = pbegin;
                imin = j;
            }
            else if (strcmp(min_c, pbegin_c) == 0)
            {
                while (min+k != NULL || pbegin+k != NULL)
                {
                    strncpy(min_c, min+k, sizeof(min_c) - 1);
                    strncpy(pbegin_c, pbegin+k, sizeof(pbegin_c) - 1);

                    if (strcmp(min_c, pbegin_c) == 1)
                    {
                        min = pbegin;
                        imin = j;
                        break;
                    }

                    k++;
                }
            }

        }
        pcolor[i] = min;
        pcolor[imin] = pt;

    }
    for (i = 0; pcolor[i] != NULL; i++)
        puts(pcolor[i]);

    return 0;
}