, , , , , , , , , , , table numerical comparison of two sample algorithms figure graphical comparison of the data from table operations required by an algorithm can be computed as sum of the times required to perform each stept (nf (nf (nfk (nthe steps requiring constant time are generally omitted since they eventually become part of the constant of proportionality consider figure ( )which shows markup of version one of the algorithm from earlier the basic operations are marked with constant time while the loops are marked with the appropriate total number of iterations figure (bshows the same algorithm but with the constant steps omitted since these operations are independent of the data set size