Math 2.0

concept

Big O notation

Summary

Big O notation compares the growth of two functions. The statement f=O(g)f = O(g) means that ∣f∣|f| is at most a constant times ∣g∣|g| near a given point or at infinity. The node big O notation gives the precise definition.

What this node needs for W2
  • edge instance_of in: at least two examples (0 of 2)
  • edge not_instance_of in: at least one non-example (0 of 1)
  • edge specializes both: the more general notions and the special cases (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

Sources

  1. Web https://en.wikipedia.org/wiki/Big_O_notation, lead section

What links here

Definitions