Assertion: prime number's factor | /r/HasProperty | depend on the type of computer
Facets:
Source sentences:
text: 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 n {\displaystyle n} and k {\displaystyle k} .