Динамические массивы

#include <iostream>

using namespace std;
void InIt(int&);
double* MemoryAllocation(int);
void RandomArray(double*, int);
void DisplayArray(double*, int);
void FreeMemory(double*);
void BubbleSort(double*, int, int);
void NewArray(double*, double*, int, int);
void Swap(double*, double*);
int main()
{
	int n;
	InIt(n);
	system("cls");
	double * c = new double [n];
	RandomArray(c, n);
	cout << "Array:   " << endl;
	DisplayArray(c, n);
	int a;
	cout << "Enter a divisor,please:  " << endl;
	cin >> a;
	BubbleSort(c, n, a);
	double * d = MemoryAllocation(n / 2);
	double k;
	cout << "Enter a digit of rounding:  ";
	cin >> k;
	NewArray(c, d, n, k);
	
	DisplayArray(d, n / 2);
	FreeMemory(c);
	FreeMemory(d);
	system("pause");
	return 0;
}
void InIt(int& n)
{
	cout << "Enter dimention of array:  " << endl;
	cin >> n;
	if (n < 0)
	{
		cout << "Error!Repeat, please: " << endl;
		InIt(n);
	}
}
double* MemoryAllocation(int n)
{
	return new double[n];
}
void RandomArray(double* a, int n)
{
	cout << "Enter array,please:  ";
	for (double *p = a; p < a + n; p++)
	{
		cin >> *p;
	}
}
void DisplayArray(double* a, int n)
{
	for (double *p = a; p < a + n; p++)
	{
		cout << *p << "  ";
	}
	cout << endl;
}
void FreeMemory(double* a)
{
	delete []a;
}
void BubbleSort(double* c, int n, int a)
{
	for (int i = n - 1; i >= 0, i % 2 == 0; i--)
	{
		for (int j = 0; j<i, j % 2 == 0; j++)
		{
			if (int(*(c + j)) % a > int(*(c + j + 1)) % a)
			{
				Swap((c + j), (c + j + 1));
			}
		}
	}
}
void Swap(double* a, double* b)
{
	int z = *a;
	*a = *b;
	*b = z;
}
void NewArray(double* c, double* d, int n, int k)
{
	double *p = d;
	double *s = c;
	for (int i = 0, j = 0; j < n; i++, j += 2)
	{
		*(p+i) = *(s+j) / k;
	}
}