Scribd
Upload
527 views2 pages

Big o

The document discusses Big-O notation and time complexity of algorithms. It defines several common time complexities including constant (O(1)), linear (O(n)), quadratic (O(n^2)), logarithmic (O(log n)), and exponential (O(a^n)). Examples are provided for each complexity. The best time complexity is constant while the worst is exponential. Polynomial time is considered more manageable than exponential time. Logarithmic time can be expressed as O(log n) regardless of base. When analyzing a function that is a sum of terms, the fastest growing term determines the overall complexity.

Uploaded by

arunkumarsh
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
527 views2 pages

Big o

The document discusses Big-O notation and time complexity of algorithms. It defines several common time complexities including constant (O(1)), linear (O(n)), quadratic (O(n^2)), logarithmic (O(log n)), and exponential (O(a^n)). Examples are provided for each complexity. The best time complexity is constant while the worst is exponential. Polynomial time is considered more manageable than exponential time. Logarithmic time can be expressed as O(log n) regardless of base. When analyzing a function that is a sum of terms, the fastest growing term determines the overall complexity.

Uploaded by

arunkumarsh
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Big-O Notation

Analysis of Algorithms
(how fast does an algorithm grow with respect to N)
(Note: Best recollection is that a good bit of this document comes from C++ For You++, by Litvin & Litvin)

The time efficiency of almost all of the algorithms we have discussed can be characterized by only a few growth rate functions:

I. O(l) - constant time


This means that the algorithm requires the same fixed number of steps regardless of the size of the task.

Examples (assuming a reasonable implementation of the task):

A. Push and Pop operations for a stack (containing n elements);


B. Insert and Remove operations for a queue.

II. O(n) - linear time


This means that the algorithm requires a number of steps proportional to the size of the task.

Examples (assuming a reasonable implementation of the task):

A. Traversal of a list (a linked list or an array) with n elements;


B. Finding the maximum or minimum element in a list, or sequential search in an unsorted list of n elements;
C. Traversal of a tree with n nodes;
D. Calculating iteratively n-factorial; finding iteratively the n th Fibonacci number.

III. O(n2) - quadratic time


The number of operations is proportional to the size of the task squared.

Examples:

A. Some more simplistic sorting algorithms, for instance a selection sort of n elements;
B. Comparing two two-dimensional arrays of size n by n;
C. Finding duplicates in an unsorted list of n elements (implemented with two nested loops).

IV. O(log n) - logarithmic time

Examples:

A. Binary search in a sorted list of n elements;


B. Insert and Find operations for a binary search tree with n nodes;
C. Insert and Remove operations for a heap with n nodes.

V. O(n log n) - "n log n " time

Examples:

A. More advanced sorting algorithms - quicksort, mergesort

VI. O(an) (a > 1) - exponential time

Examples:

A. Recursive Fibonacci implementation


B. Towers of Hanoi
C. Generating all permutations of n symbols
The best time in the above list is obviously constant time, and the worst is exponential time which, as we have seen, quickly
overwhelms even the fastest computers even for relatively small n. Polynomial growth (linear, quadratic, cubic, etc.) is
considered manageable as compared to exponential growth.

Order of asymptotic behavior of the functions from the above list:


Using the "<" sign informally, we can say that

O(l) < O(log n) < O(n) < O(n log n) < O(n2) < O(n3) < O(an)

A word about O(log n) growth:

As we know from the Change of Base Theorem, for any a, b > 0, and a, b ≠1

log a n
log b n =
log a b

Therefore,

log a n = C log b n

where C is a constant equal to loga b.

Since functions that differ only by a constant factor have the same order of growth, O(log 2 n) is the same as O(log n).
Therefore, when we talk about logarithmic growth, the base of the logarithm is not important, and we can say
simply O(log n).

A word about Big-O when a function is the sum of several terms:

If a function (which describes the order of growth of an algorithm) is a sum of several terms, its order of growth is determined by
the fastest growing term. In particular, if we have a polynomial

p(n) = aknk + ak-1nk-1 + … + a1n + a0

its growth is of the order n k:

p(n) = O(nk)

Example:

{perform any statement S1} O(1)


for (i=0; i < n; i++)
{
{perform any statement(s) S2} O(n)

{run through another loop n times} O(n2)


}

Total Execution Time: 1 + n + n2 therefore, O(n2)

You might also like