Proof of a resizable array of size N using only N +O(√N) space with O(1) time per operation is best possible Amortized cost of grow: (1+α)/α; shrink: 1/α (for strategy that grows by factor 1+α, ...

You can create a release to package software, along with release notes and links to binary files, for other people to use. Learn more about releases in our docs.