little-o notation. (definition) Definition: A theoretical measure of the execution of an algorithm, usually the time or memory needed, given the problem size n, which is usually the number of items.Click to see full answer. Also question is, what does little o mean?Little o notation is used to describe an upper bound that cannot be tight. In other words, loose upper bound of f(n). Let f(n) and g(n) are the functions that map positive real numbers.Also, what is the difference between Big O and Omega? The difference between Big O notation and Big Omega notation is that Big O is used to describe the worst case running time for an algorithm. But, Big Omega notation, on the other hand, is used to describe the best case running time for a given algorithm. Furthermore, what is the difference between Big O and small o? Big-O is an inclusive upper bound, while little-o is a strict upper bound. For example, the function f(n) = 3n is: in O(n²) , o(n²) , and O(n)What does Big O mean?Big O notation is used in Computer Science to describe the performance or complexity of an algorithm. Big O specifically describes the worst-case scenario, and can be used to describe the execution time required or the space used (e.g. in memory or on disk) by an algorithm.