For example, in ReplaceAll[expression, pattern], what are the main algorithms used internally? How does the asymptotic time / space complexity scale with the length / complexity of expression and pattern used above?
Asked
Active
Viewed 76 times
3
felix
- 549
- 2
- 5
Longest,Shortest,Repeatedand/orOrderlessPatternSequence) will be much more expensive than simple ones that just check a head (e.g.,_Integer). – Sjoerd Smit May 24 '21 at 11:28