3 ms·
Are you considering the speed of persistent data structures, that have the same big-O as their mutable counterparts? [0] 0. https://en.wikipedia.org/wiki/Persi
by mholyland 4y ago
Are you considering the speed of persistent data structures, that have the same big-O as their mutable counterparts? [0]
0. https://en.wikipedia.org/wiki/Persistent_data_structure https://en.wikipedia.org/wiki/Persistent_data_structure
- Avshalom 4y agoAlgorithmic complexity isn't the same as speed.
- mholyland 4y agoTrue. My use of the word "speed" is incorrect, or at least imprecise. The parent comment claimed that immutable data structures are slow, because you would have to copy them around, an O(N) operation. I wanted to know if they considered that operations on immutable structures can be done without copying, and have the same algorithmic complexity as the mutable data structures, if they used persistent data structures.