We say an algorithm is more efficient than another if its worst case running time has a lower order of growth. Order of growth is found with [[asymptotic analysis]].