Home > Terms > English, UK (UE) > O notation

O notation

An indication of the relative performance of an algorithm. An algorithm or the method that implements it is said to be O(1) if its execution is a constant, O(log n) if its execution is proportional to the natural log of n, or O(n) if its execution is proportional to n. O notation is frequently used as a way to compare the relative performance of operations on collections, in which case n is usually the number of elements in the collection.

This is auto-generated content. You can help to improve it.
0
Collect to Blossary

Member comments

You have to log in to post to discussions.

Terms in the News

Featured Terms

Harry8L
  • 0

    Terms

  • 0

    Blossaries

  • 1

    Followers

Industry/Domain: Games Category: Computer games

Diablo III

Diablo III is the third instalment in the Diablo franchise that pioneered the internet gaming experience some 16 years ago with its visually advanced ...

Contributor

Featured blossaries

American Library Association

Category: Culture   1 16 Terms

BrazilianPortuguese English

Category: Education   1 1 Terms