← recall

little-o term

strict upper bound — grows strictly slower than

f is o(g) if f grows STRICTLY slower than g. Stronger statement than Big-O (which allows same growth). Rarely needed in everyday engineering talk.

aliases: o(n)

topics: computer-science, algorithms

references:

• Wikipedia — Little-o notation