University of Cambridge > > Churchill CompSci Talks > Implementation of persistent arrays

Implementation of persistent arrays

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Matthew Ireland.

An array is a fundamental data structure in many programming languages. However, in functional languages using arrays can cause some side effects, to mitigate it we need to make our arrays immutable and persistent. A simple way of implementing a persistent array is using a fully balanced binary search tree. In this talk, we will discuss what kind of data structures can be used to implement persistent arrays with better time and memory complexity.

This talk is part of the Churchill CompSci Talks series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2024, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity