IS FUNCTIONAL PROGRAMMING SLOW ??
Let's bring a bit of context: C is like assembly with a bit of syntatic sugar. It's full of mutable variables in its for loops, but those loops are fast , perhaps because assembly works same way where a register will be incremented or decremented(via single processor instruction) until looping stops. In my mind, C translates easy to assembly. Now functional programming would rather have everything immutable, including elements of a loop for example, like iterating over an object that contains or generates all possible values of that loop. Which means if something has to change (change is inevitable) at some point in the program(not just in loops), those immutable state objects/structures will have to be deallocated while new state objects be created, over and over. I cannot fathom this to ever surpass traditional C like procedural programming in terms of efficiency (both speed and memory) at the fundamental machine operational level. Am I right to believe that ?