数组重排（交叉排序）C++实现

题目：

a1 a2 a3 …… b1 b2 b3 ……

重排成 ：

a1 b1 a2 b2 a3 b3 ……

（无升降序，元素可重复）

 

 

// Type your C++ code and click the "Run Code" button!
// Your code output will be shown on the left.
// Click on the "Show input" button to enter input data to be read (from stdin).

#include <iostream>
using namespace std;

// print array
void print_arr(int a[], int n) {
    for(int i = 0; i < n; i++) cout<<a[i]<<" ";
    cout<<endl;
}

// reverse array 
void reverse(int a[], int l, int h) {
    if(l>=h) return;
    int m = (l+h)/2;
    for(int i = l; i <= m; i++) swap(a[i], a[h-i+l]);
}

// rotate array partially
void rotate(int a[], int l, int m, int h) {
    if(l>=h) return;
    if(l>m) return;
    if(m>h) return;
    reverse(a, l, m-1);
    reverse(a, m, h);
    reverse(a, l, h);
}

// resort array by interval
// div means the start of the second array
void gap_sort(int a[], int n, int div) {
    if(n <= 2) return;
    
    int pre = 0;
    int cur = pre + 1;
    int a_end = div-1;
    
    while(cur != div) cur ++;
    pre ++;

    while(cur <= n-1 && pre <= a_end) {
        swap(a[pre], a[cur]);
        rotate(a, ++pre, cur, cur+1);
        pre += 3;
        cur += 2;
        a_end += 2;
    }
}

int main() {
    int arr[] = {0, 2, 4, 6, 8, 1, 3, 5, 7, 9};
    print_arr(arr, 10);
    gap_sort(arr, 10, 5);
    print_arr(arr, 10);
    return 0;
}

 

 欢迎关注微信公众号——计算机视觉：