input: Write a python function that computes the biggest prime factor of a given number n, where n > 1 and is a composite number.
  assert largest_prime_factor(15) == 5
  assert largest_prime_factor(27) == 3
  assert largest_prime_factor(63) == 7
  assert largest_prime_factor(330) == 11
  assert largest_prime_factor(13195) == 29
output: def largest_prime_factor(n):
      def largest_factor(n):
          factor = 2
          while n % factor == 0:
              n //= factor
          larger_factor = n
          factor = 3
          while factor * factor <= n:
              while n % factor == 0:
                  larger_factor = factor
                  n //= factor
              factor += 2
          return max(larger_factor, n)
  
      return largest_factor(n)