3 ms·
I don't think so, I think this is one of the easiest things to forget. Even in school, Big-O is used almost exclusively, very rarely do you see Big-Omega, Big-
by voxl 7y ago
I don't think so, I think this is one of the easiest things to forget.
Even in school, Big-O is used almost exclusively, very rarely do you see Big-Omega, Big-Theta, Little-O, etc. Even though in algorithmic analysis these are all used to give a more accurate characterization of the algorithms behavior.
Its funny, too, because the professionals (that are admittedly very smart) that like to talk down about Big-O as if it was a waste of time, seem to not realize there is a whole taxonomy of tools for analyzing and characterizing algorithmic complexity...
- deleted 7y ago[deleted]
- mav3rick 7y agoAgain you don't need to remember or forget this. Big O is worst case , theta is always guaranteed bound, Omega is minimum bound. My point is call them whatever, just know the concept to help you make design decisions.