Prime Factorization

Function Name: calculatePrimeFactors

Description

Write a function that takes a positive integer as an argument and returns its prime factorization in the form of an array. Prime factorization means breaking down a composite number into its prime factors. The function needs to return the prime factors sorted in ascending order.

For example, the prime factorization of 18 is [2, 3, 3], as it can be expressed as 2 * 3 * 3.

A prime number has exactly two distinct natural number divisors: 1 and itself. Your task is to efficiently compute the prime factors for any given positive integer.

Requirements

• The function must be named 'calculatePrimeFactors'.
• The function must take exactly one parameter: a positive integer greater than 1.
• The function must return an array of integers representing the prime factors of the input integer, sorted in ascending order.
• If the input is a prime number, the function should return an array with only that number in it.
• The algorithm should handle large numbers efficiently.
• Do not use any third-party libraries; only standard language features are allowed. Optimize for readability and maintainability.

Examples

calculatePrimeFactors(18) should return [2, 3, 3].calculatePrimeFactors(19) should return [19], since 19 is a prime number.calculatePrimeFactors(56) should return [2, 2, 2, 7].

Links