Advertisement
Advertisement
| 06.22.2008 at 01:06PM PDT, ID: 23506093 |
|
[x]
Attachment Details
|
||
|
[x]
The Solution Rating System
|
||
With so many solutions, how can you tell which solutions are most likely to help you and which ones are not? To provide you with a tool to use, we rate our solutions based on various elements that most accurately determine if a solution is a quality solution. To explain what factors affect the solution rating, here are the elements we take into consideration when formulating our solution rating.
Your Input Matters If you have any suggestions that you would like to make for our rating system, please ask a question in the Suggestions Zone of Community Support. Thank you! |
||
1: 2: 3: 4: 5: 6: 7: 8: 9: 10: 11: 12: 13: 14: 15: 16: 17: 18: 19: 20: 21: 22: 23: 24: 25: 26: 27: 28: 29: 30: 31: 32: 33: 34: 35: 36: 37: 38: 39: 40: 41: 42: 43: 44: 45: 46: 47: 48: 49: 50: 51: 52: 53: 54: 55: 56: 57: 58: 59: 60: 61: 62: 63: 64: 65: 66: 67: 68: 69: 70: 71: 72: 73: 74: 75: 76: 77: 78: 79: 80: 81: 82: 83: 84: 85: 86: 87: 88: 89: 90: 91: 92: 93: |
#include <iostream>
using namespace std;
#define SIZE 20
class QueueClass {
int queue[SIZE];
int head, tail;
public:
QueueClass(int, int);
~QueueClass();
void qu(int num);
int dequ();
int size();
bool isEmpty();
int Increment(int offset);
};
QueueClass::~QueueClass () {}
QueueClass::QueueClass (int a, int b) {
head = a;
tail = b;
}
int QueueClass::Increment(int offset) {
offset++;
if (offset > SIZE) offset = 0;
return offset;
}
void QueueClass::qu(int num)
{
// Recognize a full queue
if (Increment(tail) == head) {
std::cout << "The queue is full" << std::endl;
// Add to a not-full queue
}
else {
queue[tail] = num; // Reversed this one
tail = Increment(tail); // ..with this one
}
}
int QueueClass::dequ()
{
if (isEmpty()) {return 0;}
else
{
//head++;
//
//return queue[head];
int tempHead = head;
head = Increment(head);
return queue[tempHead];
}
}
int QueueClass::size()
{
int tempTail = (tail >= head) ? tail : tail + SIZE;
int size = tempTail - head;
return size;
}
bool QueueClass::isEmpty()
{
bool isEmpty = head == tail;
if (isEmpty) cout << "Queue is empty\n";
return isEmpty;
}
int main()
{
QueueClass queue1(0,0);
queue1.isEmpty();
cout <<"size is " <<queue1.size() <<std::endl;
queue1.qu(1);
queue1.isEmpty();
cout <<"size is " <<queue1.size() <<std::endl;
}
|