>>16712381
algorithms are usually analyzed in an undergrad course by reducing each step in the algorithm to some value and then discarding the constant-valued terms, the point being to single out loops and other input-dependent paths, which form a polynomial whose degree is essentially the upper bound on the time complexity otherwise known as the asymptotic complexity or the 'big oh' value of the algorithm. so the actual math involved is basically just college algebra. this is the main topic of chapter 1 of introduction to algorithms or CLRS.