I'm trying to make a program that will put n amount of orders into a queue in the same order that the user enters them and then will remove the first n orders that the user inputs and prints the cost of these orders. Can anyone help me get started I really am not sure where to begin.
A good tip would be to calculate the cost before you remove them, then
assuming you are using a linked list point the base pointer to the next order
and free any memory allocated to the orders to be deleted.
If you send me £50 I will write the code
I'm not gonna PAY for it, but thanks for the advice.
What is the cost of an order anyways?
Well presumably in the order there is a 'cost' field/item,Originally Posted by Japatron
What is the cost of an order anyways?
thats it!!
