Help with big O calculation


#1

Would the big O notation for this java method be O(N) even if it iterates n/2 times?

public static boolean isPalindrome(String str)
{
	for (int x = 0; x < str.length()/2; x++)
	{
		if(str.charAt(x) != str.charAt(str.length() - 1 - x))
		{
			return false;
		}
	}
	return true;
}

Thanks!