recursive call from cycle: big O of algorithm and its steps

Question

I want to understand how to evaluate the complexity, big O, of below algorithm and how to approach those kind of issues of big O estimations in the future with kinda-like al