Suppose I have an integer $n$ with e.g. a large number of say decimal digits.
I would like to get some information about the runtime "cost" of standard CAS algorithm which factors $n$ into primes in comparison to the CAS algorithm which decomposes a polynomial of degree $n$ into irreducible factor polynomials.
Which problem is faster solved ?