Contents    Page-10    Prev    Next    Page+10    Index   

Finding Big O: Log-log Graph

There are two ways to find the order of a computation:

A plot of time versus n on a log-log graph allows Big O to be found directly. Polynomial algorithms show up as straight lines on log-log graphs, and the slope of the line gives the order of the polynomial.