What is the worst-case complexity of the following function?

int findUC (string s) { for (int i = 0; i < s.size(); i *= 2) { if (s[i] >= 'A' && s[i] <= 'Z') return i; } return string::npos; } 

Please provide explanation. Thank you.