Dear Akram Alhelbawy,

Here another approach of answering for your question, please take a look at this link.

https://www.freecodecamp.org/news/lets-simplify-algorithm-complexities-25e75f37d03f/

Best regards

Unrolling the loop (i.e. explicitly coding each iteration without using for...while...until structures) is (almost) always processed faster, assuming the code is already loaded into RAM. This happens because the CPU doesn't have to check if the end condition is met (this is of greater importance if the condition is a long and complex logical statement) and increment the counter/pointer (this is generally less important) for each iteration. This is especially true for (some) interpreted languages since, in this case, we have to account for the additional time and process burden of interpreting the loop instructions.

But... is it worth it? It depends: if the code inside the loop is substantial (i.e., "CPU-heavy"), the speed gains could be marginal, at best.

Unrolling loops always wastes more memory. If the unrolled loop does not fit into the available RAM (i.e., it has to be loaded from disk/flash in parts), the result may even be worse! This rarely happens on PCs, of course... but might be a factor in modestly resourced micro-controller solutions.

So... unrolling the loops is only worth it in very particular circumstances.

Generally, it should be avoided unlesse strictly critical processing times/speeds need to be met.

Nowadays, with plentiful machine resources... it's almost always a bad idea: it's wasteful and produces terribly inelegant, ugly, unconcise and difficult to read code.