- As you may know, a data structure is a means of organizing
- data. The simplest data structure is the array, a linear list that allows random access to its elements. Arrays are often used as the basis for more sophisticated data structures, such as stacks and queues.
- Stack is a list in which elements can only be accessed in the order of first in, last out (FILO, first-in, last-out). Queue is a list in which elements can only be accessed in the order of first in, first out (FIFO, first-in, last-out). Therefore, a stack is like a stack of plates on a table – the first one from the bottom to the top is the last to be used. A queue is like a queue at a bank – the
- The first in line is the first to be served.
- What makes data structures like stacks and queues interesting is that they combine the storage of information with the methods that access it. Therefore, stacks and queues are data machines where storage and retrieval are provided by the data structure itself and not manually by the program. Of course this combination is a great option for a class and in this project you will create a simple queue class.
- In general, queues support two basic operations: put and get. Each put operation inserts a new element at the end of the queue. Each get operation retrieves the next element from the beginning of the queue. Queue operations are consuming in nature:
- when an element is removed, it cannot be recovered again. The queue can also be full if there is no space available to store an item, and empty if all elements have been removed.
- One last thing: there are two basic types of queues – circular and non-circular. A circular queue reuses the underlying array locations when elements are removed.
- Uses length to compare array sizes.
A non-circular queue does not reuse locations and ends up being exhausted. To put it simply, this example creates a non-circular queue, but with a little thought and effort, you can easily turn it into a circular queue.
QDemo.java
The above is the detailed content of Try This A Queue class. For more information, please follow other related articles on the PHP Chinese website!