#include

using namespace std;

const int N= 101;

int a[N] = {0, 4, 5, 7, 8, 1, 2, 3, 6};

int temp[N];

void merge(int L, int mid, int R) {

int i=L, j=mid+1, idx=L;

while(i<=mid && j<=R) {

if(a[i]<=a[j]) {

temp[idx++] = a[i];

i++;

} else {

temp[idx++] = a[j];

j++;

}

}

while(i<=mid) {

temp[idx++] = a[i];

i++;

}

while(j<=R) {

temp[idx++] = a[j];

j++;

}

for(int i=L; i<=R; i++)

a[i] = temp[i];

}

int main() {

merge(1, 4, 8);

for(int i=1; i<=8; i++)

cout<

return 0;

}