Creating a Queue as a Dynamic Array

[Daniel Rodriguez]

#include <iostream>

using namespace std;

void addElem(int num);
void delElem();

int num;
int main()
{
	
	char ans;
	cout << "Begin Queue Operation" << endl;
	cout << "******************************" << endl << endl;
	cout << "Do you wish to add an Element to the Queue?: ";
	cin >> ans;

	if(ans == 'Y' || 'y')
	{
		cout << "Enter the integer to store in the Queue:" << endl;
		cin >> num;
		addElem(num);

	}
	else
	{
		cout << "Then you wish to delete an Element from the Queue!" << endl;
		delElem();
	}
	

	return 0;
}

int *currentArray = 0;
int *tempArray = 0;
int index, oldSize, newSize;

void addElem(int num)
{
	currentArray = new int[oldSize];
	tempArray = new int[newSize];

	for(index = 0; index < oldSize; index++)
	{
		tempArray[index] = currentArray[index];
	}
	
	delete[] currentArray;
	currentArray = tempArray;
	tempArray = 0;
}

void delElem()
{
	currentArray = new int[oldSize];
	tempArray = new int[newSize];

	for(index = 0; index < oldSize; index++)
	{
		tempArray[index] = currentArray[index + 1];
	}

	delete[] currentArray;
	currentArray = tempArray;
	tempArray = 0;
}

I have generated an array for the Queue. I just need help implementing a Queue into this code. Can anyone help me?

[viliml]

use the STL queue's range constructor:
queue<int> q(currentarray, currentarray+newsize)

[Daniel Rodriguez]

Oh, okay thanks.