data-structure-deque
C++
★ 5
updated 6y ago
A deque of O(sqrt n) complexity on access, insert and remove, with an optimization for O(log n) access based on fenwick tree.
No plain-English explanation yet — one is being written right now. Check back in a minute.