Can somebody show me how to make queue algorithm? How many kind of queues in programming? how to make a fast queue algorithm.
Can somebody show me how to make queue algorithm? How many kind of queues in programming? how to make a fast queue algorithm.
If you know how to makea linked list then you know how to make a Queue. Its late now and im gonna hit the sack so no code until 2moro but the idea is simple.....
make linked list
keep track of tail of list and head of list by pointers
add new events to tail of list -> update tail pointer
pull new events from head of list ->update head pointer.
simple. you now have a linked list that operates as a first in first out structure.
Free the weed!! Class B to class C is not good enough!!
And the FAQ is here :- http://faq.cprogramming.com/cgi-bin/smartfaq.cgi
Look in a good data structures book. There are many examples of variations of the Queue ADT.
Mr. C.
Actually, a queue and a linked-list are not the same thing.
A queue normally consists of an array of consecutive, adjacent memory objects (like an array of chars or longs or structs). Then two pointers are used. One for head and one for tail.
Data is poked into the queue via one pointer and removed via a second pointer. One is usually called the 'head' pointer and the other the 'tail' pointer.
The concept can be applied to linked lists, but really, a linked list is a linked list.
It is not the spoon that bends, it is you who bends around the spoon.
show my an example please.
thanks.
