 Their running time is given in terms of formula_1, the number to be tested and, for probabilistic algorithms, the number formula_70 of tests performed.Moreover, formula_222 is an arbitrarily small positive number, and log is the logarithm to an unspecified base.The big O notation means that each time bound should be multiplied by a constant factor to convert it from dimensionless units to units of time; this factor depends on implementation details such as the type of computer used to run the algorithm, but not on the input parameters formula_1 and formula_70.