CSE 2320: Algorithms and
Order of Growth
of a running-time function
is the fastest growing term, discarding constant factors.
Now we can say Insertion-Sort better than XYZ-Sort
for large inputs
Copyright © 1998 The University of Texas at Arlington