Haskell: Lists, Arrays, Vectors, Sequences

I’m learning Haskell and read a couple of articles regarding performance differences of Haskell lists and (insert your language)’s arrays.

Being a learner I obviously just use lists without even thinking about performance difference.
I recently started investigating and found numerous data structure libraries available in Haskell.

Can someone please explain the difference between Lists, Arrays, Vectors, Sequences without going very deep in computer science theory of data structures?

Also, are there some common patterns where you would use one data structure instead of another?

Are there any other forms of data structures that I am missing and might be useful?

1 Answer
1

Leave a Comment