#pragma once

class queue
{
private:
	double* items;
	int front;
	int numItems;
	int capacity;

	void resize(int newCap)
	{
		//Do on your own
	}

public:
	queue()
	{
		items = new double[5];
		front = 0;
		numItems = 0;
		capacity = 5;
	}

	//Add x to back
	void enqueue(double x)
	{
		if (numItems == capacity)
			resize(2 * capacity);

		int pos = (front + numItems) % capacity;
		items[pos] = x;
		numItems++;
	}

	//Remove and return front item from queue
	double dequeue()
	{
		double answer = items[front];
		
		front = (front +1)%capacity;
		numItems--;

		return answer;
	}

	bool empty()
	{
		if (numItems == 0)
			return true;
		else
			return false;
	}
};