BSc CSE Study Library

Algorithm Math & Complexity

Definitions, examples and Computer Science applications for this mathematics subject.

Arithmetic Series

An arithmetic series is the sum of an arithmetic sequence with a constant difference.

Asymptotic analysis studies how an algorithm’s resource usage grows as input size becomes large.

Big O gives an asymptotic upper bound on the growth of a function, commonly used for algorithm complexity.

Big Omega gives an asymptotic lower bound on growth.

Big Theta gives a tight asymptotic bound when upper and lower growth rates match.

Exponential growth multiplies by a constant factor as input increases and becomes large quickly.

A geometric series is the sum of terms in a geometric sequence with a constant ratio.

Logarithmic growth increases very slowly as input size grows.

Polynomial growth has the form nᵏ for a fixed constant k.

Summation notation compactly represents the addition of a sequence of terms.