So why do we drop the 6 coefficient on the n^2 term ?, {nl} which will allow us to easily identify which algorithms have faster running times for large values of n {nl} -Calculating the coefficients for the running time of algorithms is often time consuming, error prone and inexact. However, identifying the most significant term for the running time is often straight forward. {nl} - The coefficient for the exact same algorithm will be different depending on which computer you run it on (algorith
