Skip to content

Is works on the principle of a ring buffer. Due to the fact that there is no need to allocate memory again, each operation is performed in O(1). This queue implementation has a significant drawback: a limit on the maximum size.

License

Notifications You must be signed in to change notification settings

MrKalister/deque_with_ring_buffer

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

3 Commits
 
 
 
 
 
 
 
 

Repository files navigation

Deque with ring buffer

Description:

Is works on the principle of a ring buffer. Due to the fact that there is no need to allocate memory again, each operation is performed in O(1). This queue implementation has a significant drawback: a limit on the maximum size.

Technologies:

Python 3.9.10

Installation and launch:

  1. Clone the repository. On the command line:
git clone https://github.com/MrKalister/deque_with_ring_buffer.git

or use SSH-key:

git clone git@github.com:MrKalister/deque_with_ring_buffer.git
  1. Fill in input.txt in accordance with the example available in it.

Author

Maxim Novikov

About

Is works on the principle of a ring buffer. Due to the fact that there is no need to allocate memory again, each operation is performed in O(1). This queue implementation has a significant drawback: a limit on the maximum size.

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages