#include
#include
#include
typedef int ItemType;
const int MaxSize = 4;
ItemType Queue[MaxSize];
int Front, Rear, Count;
void CreateQueue()
{
Front = 0;
Rear = MaxSize-1;
Count = 0;
}
void Advance(int & Index)
{
Index++;
if (Index == MaxSize)
Index = 0;
}
void AddQueue( const ItemType &Item)
{
if (Count == MaxSize)
{
cerr << "ERROR: Cannot insert -- queue is full" << endl;
exit(1);
}
else
{
Advance(Rear);
Queue[Rear] = Item;
Count++;
}
}
void DelQueue(ItemType & Item)
{
if (Front == Rear)
{
cerr << "ERROR: Cannot remove -- queue is empty" << endl;
exit(1);
}
else
{
Item = Queue[Front];
Advance(Front);
Count--;
}
}
void main()
{
ItemType item;
CreateQueue();
AddQueue(28);
AddQueue(70);
AddQueue(33);
DelQueue(item);
cout<
AddQueue(125);
AddQueue(99);
}
.: Weblog Themes By Pichak :.

