Are there any imperative languages with lists that don't support fast random access?

Published: 5/10/2017
Are there any imperative languages with lists that don't support fast random access?
Source: SOFTWAREENGINEERING.STACKEXCHANGE.COM

I am writing a paper about improving the implementation of list ADTs. I would like to know, are there any imperative languages where indexing a list is not a fast operation / not constant time?

Read more
Related news
Comment