What is the worst case time complexity for this algo in Java?

Question

I am trying to calculate the time complexity in the worst case (Tw(n)).

The following conditions apply:

• Lines with a return, a decleration, an initialization