O 표기법 oor Engels

O 표기법

Vertalings in die woordeboek Koreaans - Engels

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.

voorbeelde

이 개념은 Big O 표기법으로 주로 표현된다.
This justifies usage of big O notation in the definition.

들면 N = 1, 2, 3, 4, 5, ... , 그리고 각 숫자별로 (고전적인 표기법으로 궤도를 의미하는) K, L, M, N, O, ...가 각각있다.
For n = 1, 2, 3, 4, 5, ..., the letters associated with those numbers are K, L, M, N, O, ... respectively.

그러나, 로그의 밑이 변할 때, loga n 와 logb n 는 오로지 상수 승수 에 따라서만 달라지며 이것은 빅-오 표기법에서는 버림한다; 그러므로 O(log n )은 로그의 밑과 상관없이 로그 시간 알고리즘에 대한 표준 표기법이 된다.
However, by the change of base for logarithms, loga n and logb n differ only by a constant multiplier, which in big-O notation is discarded; thus O(log n ) is the standard notation for logarithmic time algorithms regardless of the base of the logarithm.