【编程之法】2.9 完美洗牌问题

样例输入
10
1 2 3 4 5 6 7 8 9 10
样例输出
Perfect Shuffle:6 1 7 2 8 3 9 4 10 5

#include<iostream>
#include<cstdio>
using namespace std;

const int maxn = 100;

// 数组下标从1开始，from是圈的头部，mod是要取模的数，因此mod应该为2n+1，时间复杂度O(圈长)
void CycleLeader(int *a, int from, int mod)
{
    int t, i;
    for(i = from*2 % mod; i != from; i = i*2 % mod)
    {
        t = a[i];
        a[i] = a[from];
        a[from] = t;
    }
}

// 反转字符串的时间复杂度为O(to-from)
void reverse(int *a, int from, int to)
{
    int t;
    for(; from < to; ++from, --to)
    {
        t = a[from];
        a[from] = a[to];
        a[to] = t;
    }
}

// 循环右移num位，时间复杂度为O(n)
void RightRotate(int *a, int num, int n)
{
    reverse(a, 1, n-num);
    reverse(a, n-num+1, n);
    reverse(a, 1, n);
}

// 完美洗牌时间O(n),空间O(1)
void PerfectShuffle(int *a, int n)
{
    int n2, m, i, k, t;
    for(; n > 1; )
    {
        // 1st
        n2 = n*2;
        for(k = 0, m = 1; n2 / m >= 3; ++k, m *= 3)
            ;
        m /= 2;
        // 2m = 3^k-1, 3^k <= 2n < 3^(k+1)

        // 2nd
        RightRotate(a+m, m, n);

        // 3rd
        for(i = 0, t = 1; i < k; ++i, t *= 3)
        {
            CycleLeader(a, t, m*2+1);
        }

        // 4th
        a += m*2;
        n -= m;
    }
    // n = 1 : 1.原始n==1；2.在操作最后 剩下最后的两个元素，a 也指向了倒数第二个元素
    t = a[1];
    a[1] = a[2];
    a[2] = t;
}

int main()
{
    int a[maxn] = {0};
    int n0;
    cin >> n0;
    for(int i = 1; i <= n0; ++i)
    {
        cin >> a[i];
    }

    PerfectShuffle(a, n0/2);

    cout << "Perfect Shuffle:";
    for(int i = 1; i <= n0; ++i)
    {
        cout << a[i] << " ";
    }

    return 0;
}

运行结果