Basic data structure: sequential representation of queues

The following is an algorithm for the operation queue, which is listed as a static queue and is implemented with a loop array.

The length of memory allocated to the queue is len+1, but only the Len memory space is actually used to save the data, in order to make it easier to judge the queue's full and empty. The front position in the queue holds the data of the team head, the data of the team at the previous position of the rear position, and the data is not stored in the rear position, the purpose of this is to facilitate the operation of the queue on the team and out, without regard to the special circumstances.

Operating system: Ubuntu

Compiling software: GCC

Results screenshot: