User:Alf3xs: Difference between revisions
Content added Content deleted
(Deque in C++) |
(Blanked the page) |
||
| Line 1: | Line 1: | ||
Below is a C++ implementation of a Deque. |
|||
It uses a Circular Doubly Linked Unrolled Linked List of Circular Arrays as its underlying data structure to increase pushing and popping performance. Insertions and erasures, while are both constant time in circular arrays and linked lists, they are noticeably faster (at least without optimizations) in arrays. |
|||