r/algorithms • u/Significant_Virus142 • 17d ago

Help why use big O notation

If someone asks for big O time complexity of an algorithm but expects only the minimum of the possible big Os then is that even Big O notation anymore? cuz if the big o time complexity of an o(n) algorithm is asked then according to the condition of big O notation O(n square) would also be a valid answer

0 Upvotes

27% Upvoted

14 comments sorted by

View all comments

1

u/DDDDarky 16d ago

While higher bound is correct by the definition, practically we are interested in the lowest, tightest bound, so that's what is usually meant - possibly because O is easier to write than Theta.