Thread: queue

i dont know if my question was worded properly before, what i need to do is:

Enter several values and store them in a queue
display the highest value in the structure

all i need really is how to display the the highest value, im having major problems with this, so if you could help me i would be very grateful.

Who is your daddy and what does he do

Do you know what a queue actually is? Hell, if all you care about is the ___ value, then you just have to make sure it always stays on top.

NODE *myList;

...some value is inserted to a node in the list...
...some new value is inserted into 'newnode'...

Code:

if( newNode->value < myList-> value )
{
   newNode->next = myList->next;
   myList->next = newNode;
}
else
{
   newNode->next = myList;
   myList = newNode;
}

What seems to be the problem? You don't even need a double linked list for this.

You could just as easily use an array for your queue.

Quzah.

thanx. im meant to use a queue to do this, an ADT priority queue, im not allowed to use linked list. Im a pretty bad programmer, so im not sure whats goin on :P.

what i have to do i enter details store them in a queue then displa the values in order of priority i.e highest number first. im not meant to use linked lists, but ADT queue. thanx

So use an array:

Code:

int arrayOfValues[SIZE];
int highestValueIndex;
int arrayCount;

/* add the new value to the array */
arrayOfValues[arrayCount] = newValue;

/* check highest value */
if( newValue > arrayOfValues[highestValueIndex] )
   highestValueIndex = arrayCount; /* fix highest value index */

/* increment count */
arrayCount++;

Simple stuff.

Quzah.

thanx