Question about access to the list from the noobie functional programmer

Question

This may be a silly and obvious question, but why are examples of list access algorithms implemented in linear time? I understand that most applications include jump lists, not random access to them, but what if you want to access a random access list?

Answer 1

Because design lists are a linear structure. This is a canonical recursive data type defined as:

 data [a] = [] | a : [a]

, node, , .

, , .

. ( ) ( , ).

: - . , , .

Answer 2

Haskell ; , , .

, . , Data.Array Data.IntMap.