下一次最近排列

void swap(int *a, int *b)
{
    int c = *a;
    *a = *b;
    *b = c;
}
void reverse(int *array, int begin, int end)
{
    int i, j;
    for (i = begin, j = end; i < j; i++, j--)
    {
        swap(&array[i], &array[j]);
    }
}

int next_permutation(int *array, int begin, int end)
{
    if (array == NULL || begin >= end)
    {
        return 0;
    }
    int i, j, k;
    for (j = end, i = end - 1; i >= begin && j > begin; j--, i--)
    {
        if (array[i] < array[j])
        {
            break;
        }
    }
    if (j == 0 && i == -1)
    {
        return 0;
    }

    for (k = end; k >= j; k--)
    {
        if (array[k] > array[i])
        {
            break;
        }
    }
    swap(&array[i], &array[k]);
    reverse(array, i + 1, end);    
    return 1;
}

int main(void)
{
    int array[4] = {1, 2, 3, 4};
    int begin = 0, end = 3;
    do
    {
        int i;
        for (i = 0; i <= end; i++)
        {
            cout << array[i] << ", ";
        }
        cout << endl;
    }while (next_permutation(array, begin, end));
    getchar();
    return 0;
}