Any algorithm that needs mutable data to be performant would be a bad fit. Numerical number crunching isn’t stellar either. That said, there are ways to extend

Any algorithm that needs mutable data to be performant would be a bad fit. Numerical number crunching isn’t stellar either. That said, there are ways to extend the BEAM with C or Rust code to make those areas performant. I’ve written one such extension (called a NIF; forget what it stands for exactly) and it wasn’t all that hard.