Growth Rates, etc.
Even by ignoring constant factors, can get an excellent idea of whether a given algorithm will be able to run in a reasonable amount of time on a problem of a given size.
The “big Oh” notation and worst-case analysis are tools that greatly simplify our ability to compare the efficiency of algorithms.