Pollard's rho algorithm is a special-purpose integer factorization algorithm. What is its expected time complexity to find a factor $p$ of a composite number $n$?