The Shift-To-Middle Array is a high-performance dynamic array that optimizes insertions and deletions at both ends while maintaining contiguous memory storage for improved cache locality and efficient parallel processing. Unlike std::deque, which uses a fragmented block structure, this array dynamically redistributes space to avoid costly shifts by moving elements toward the middle during resizing. The time complexity of Shift-To-Middle Array operations is compared to other data structures, showcasing its efficient performance. Benchmarks demonstrate improvements in performance depending on hardware capabilities. This project is licensed under the MIT License, and contributions are welcomed. Optimize your data structures with the Shift-To-Middle Array today!
https://github.com/attilatorda/Shift-To-Middle_Array