#include "stdafx.h"
#include <iostream>
#include <boost/foreach.hpp>
using namespace std;
using namespace boost;
/**
* 合并两个排好的序列
* @param A
* int数组
* @param p
* 起始位置
* @param q
* 中间位置
* @param r
* 终止位置
* @param isInc
* isInc 是否升序,true为升序,false为降序
*/
void merge(int* A, int p, int q, int r, bool isInc)
{
int nLeft = q - p + 1;
int nRight = r - q;
int *left = new int[nLeft];
int *right = new int[nRight];
int i = 0, j = 0, k = 0;
for (i = 0; i < nLeft; i++)
left[i] = A[p + i];
for (j = 0; j < nRight; j++)
right[j] = A[q + j + 1];
i = 0; j = 0;
for (k = p; k <= r; k++)
{
if (isInc ^ (left[i] <= right[j]))
{
A[k] = right[j];
j++;
}
else
{
A[k] = left[i];
i++;
}
if (i == nLeft)
{
k++;
for (; j < nRight; j++)
{
A[k] = right[j];
k++;
}
}
if (j == nRight)
{
k++;
for (; i < nLeft; i++)
{
A[k] = left[i];
k++;
}
}
}
}
/**
* 合并排序
* @param A
* int数组
* @param p
* 起始位置
* @param r
* 终止位置
* @param isInc
* 是否升序,true为升序,false为降序
*/
void mergeSort(int *A, int p, int r, bool isInc)
{
int q = 0;
if (p < r)
{
q = (p + r) / 2;
mergeSort(A, p, q, isInc);
mergeSort(A, q + 1, r, isInc);
merge(A, p, q, r, isInc);
}
}
int _tmain(int argc, _TCHAR* argv[])
{
int a[] = {2,4,5,7,20,23,15,33, 0,1,3};
int iSize = sizeof(a)/sizeof(int) - 1;
mergeSort(a,0,iSize,false);
BOOST_FOREACH(int value,a)
{
cout<<value<<" ";
}
system("pause");
return 0;
}
#include <iostream>
#include <boost/foreach.hpp>
using namespace std;
using namespace boost;
/**
* 合并两个排好的序列
* @param A
* int数组
* @param p
* 起始位置
* @param q
* 中间位置
* @param r
* 终止位置
* @param isInc
* isInc 是否升序,true为升序,false为降序
*/
void merge(int* A, int p, int q, int r, bool isInc)
{
int nLeft = q - p + 1;
int nRight = r - q;
int *left = new int[nLeft];
int *right = new int[nRight];
int i = 0, j = 0, k = 0;
for (i = 0; i < nLeft; i++)
left[i] = A[p + i];
for (j = 0; j < nRight; j++)
right[j] = A[q + j + 1];
i = 0; j = 0;
for (k = p; k <= r; k++)
{
if (isInc ^ (left[i] <= right[j]))
{
A[k] = right[j];
j++;
}
else
{
A[k] = left[i];
i++;
}
if (i == nLeft)
{
k++;
for (; j < nRight; j++)
{
A[k] = right[j];
k++;
}
}
if (j == nRight)
{
k++;
for (; i < nLeft; i++)
{
A[k] = left[i];
k++;
}
}
}
}
/**
* 合并排序
* @param A
* int数组
* @param p
* 起始位置
* @param r
* 终止位置
* @param isInc
* 是否升序,true为升序,false为降序
*/
void mergeSort(int *A, int p, int r, bool isInc)
{
int q = 0;
if (p < r)
{
q = (p + r) / 2;
mergeSort(A, p, q, isInc);
mergeSort(A, q + 1, r, isInc);
merge(A, p, q, r, isInc);
}
}
int _tmain(int argc, _TCHAR* argv[])
{
int a[] = {2,4,5,7,20,23,15,33, 0,1,3};
int iSize = sizeof(a)/sizeof(int) - 1;
mergeSort(a,0,iSize,false);
BOOST_FOREACH(int value,a)
{
cout<<value<<" ";
}
system("pause");
return 0;
}