Find the first prime factor of n

FirstPrimeFactor.c

int FirstPrimeFactor(int n)
{
	if(n == 0 || n == 1)
	{
		return n; // 0 and 1 have no prime factors
	}
	if(n < 0)
	{
		n = -n; // Work with absolute value
	}
	// Check divisibility by 2 (the only even prime)
	if(n % 2 == 0)
	{
		return 2;
	}
	// Check odd divisors from 3 to sqrt(n)
	for (int i = 3; i <= sqrt(n); i += 2)
	{
		if(n % i == 0)
		{
			return i; // Return the first prime factor found
		}
	}
	// If no divisor found, n is prime
	return n;
}