| # Prime Factorization | |
| ## Description | |
| Factor a positive integer into prime factors, preserving multiplicity. | |
| ## Input | |
| The function receives an integer $n$ and a writable output array. | |
| ## Output | |
| Write the prime factors of $n$ to the output array in nondecreasing order. | |
| ## Constraints | |
| - $1 \le n \le \texttt{INT_MAX}$. | |
| ## Source | |
| Classical integer-factorization problem reconstructed from the verified C artifact. | |