Efficiency of purely functional programming

Posted by Sid on Stack Overflow See other posts from Stack Overflow or by Sid
Published on 2010-01-02T03:02:10Z Indexed on 2010/05/23 6:20 UTC
Read the original article Hit count: 311

Does anyone know what is the worst possible asymptotic slowdown that can happen when programming purely functionally as opposed to imperatively (i.e. allowing side-effects)?

Clarification from comment by itowlson: is there any problem for which the best known non-destructive algorithm is asymptotically worse than the best known destructive algorithm, and if so by how much?

© Stack Overflow or respective owner

Related posts about algorithm

Related posts about functional-programming