Doubt regarding the time complexity

#1

I have a doubt regarding the time complexity of the approch .
is it O(root(n))

In this approac basically we are swapping first 2 elments moving right by 1 index then again swapping right???