看不懂的组合算法

看不懂的组合算法

#include <stdio.h>
int startflag = 0;
unsigned char tt(int* arr, int x)
{
    int i = 0;
    int dat = 0;
    for (i = 0; i < x; i++)
    {
        dat |= (1 << arr[i]);
    }
    return dat;
}

void cbk_print2(int* subset, int k, unsigned char (*cbk1)(int* arr, int x))
{
    int x = k;
    printf("{");
    for (int i = 0; i < k; i++)
    {
        printf("%d", subset[i]);
        (i == k - 1) ? printf("") : printf(", ");
    }
    printf(":%d ", cbk1(subset, x));
    printf("}\n");
}


void combine(int s[], int n, int k, void (*cbk)(int* subset, int k, unsigned char (*cbk1)(int* arr, int x)))
{
    static int subset[3] = { 0,0,0 };//数组越界了，可以考虑使用malloc
    static int lenth = 0;
    if (!startflag)
    {
        startflag = 1;
        lenth = k;
    }

    if (k == 0)
    {
        cbk(subset, k , tt);
        return;
    }

    for (int i = n; i >= k; i--)
    {
        subset[k - 1] = s[i - 1];
        if (k > 1)
        {
            combine(s, i - 1, k - 1, cbk);
        }
        else
        {
            cbk(subset, lenth, tt);
        }
    }
}



int main()
{
    int list[] = { 0,1,2,3,4,5,6,7 };
    int list2[] = { 1,0,3 };
    combine(list, 8, 3, cbk_print2);
    startflag = 0;
    //combine(list, 5, 2, cbk_print2);
    //printf("%d \n", tt(list2));
    /* 我的第一个 C 程序 */
    printf("Hello, World! \n");

    return 0;
}