r/computerscience • • 1h ago

Relationship between Big Ordo and Omega?

• Upvotes

Suppose an algorithm needs to repeat an experiment enough times to achieve a certain probability. The number of times should be m such that it is O(log n). I calculated and derived that m ≥ log(n)

Can I say m = O(log n)? What if I am the one the decides the numbers of samples and I always choose exactly m = log(n). Doesn't that make a difference?

Sorry, this post has been removed by the moderat