If you need an algorithm that runs fast by mutating data in place, then an immutable-data functional language can’t implement those. The classic example is Quicksort; Quicksort with immutable data has to copy the data and/or the array/list for each iteration, and thus runs much slower than the cache-optimal in-place mutable version. (It also generates a lot of garbage, and thus runs slower because of that, too.)