Talk:Persistent array

This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science articles

Low

This article has been rated as Low-importance on the project's importance scale.

Things you can help WikiProject Computer science with:

Here are some tasks awaiting attention:

Article requests :
- Requested articles/Applied arts and sciences/Computer science, computing, and Internet
Cleanup :
- Computer science articles needing attention
- Computer science articles needing expert attention
Copyedit :
- Computing
Expand :
- Computer science
Infobox :
- Computer science articles without infoboxes
Maintain :
- Timeline of computing 2020–present
Photo :
- Find pictures for the biographies of computer scientists (see List of computer scientists)
- Computing articles needing images
Stubs :
- Computer science stubs
Unreferenced :
- WikiProject Computer science/Unreferenced BLPs
Project-related :
- Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

"Backers trick" should probably be "Baker's trick", since it is most likely referring to "Henry G. Baker. Shallow binding makes functional arrays fast. SIGPLAN Not., 26(8):145–147, 1991.". Per Mildner (talk) 19:57, 22 December 2020 (UTC)[reply]

Tree of Modifications

I removed the second implementation from the main article (attached below) since the time complexity of lookups appears to be $\Theta (n)$ in the worst case, which is much worse than the other implementations. Perhaps this implementation can be re-added if accompanied by an explanation of why this implementation is preferred over the others.

Update: I added it back (with a note about the worst case time complexity).

B52481 (talk) 05:12, 19 June 2023 (UTC)[reply]