If an $(n^2)$ algorithm and an $(n)$ algorithm exist for the same task, then for large enough $n,$ the $(n^2)$ algorithm does more work and takes longer to execute, regardless of the constant factors for peripheral work.

$$ True

False