A visual proof of amortised-linear resizable arrays

Authors:
Don Blaheta
Affiliations:
Knox College, Galesburg, IL, USA
Venue:
ITiCSE '09 Proceedings of the 14th annual ACM SIGCSE conference on Innovation and technology in computer science education
Year:
2009

Citing 1
Cited 1

Data Structures and Algorithms in Java

Data Structures and Algorithms in Java

An alternative visual analysis of the build heap algorithm

ACM Inroads

Quantified Score

Hi-index	0.00

Visualization

Abstract

We demonstrate visually why doubling capacity is the better strategy when resizing arrays. The visual proof makes simple amortised analysis more accessible to a CS2 audience.