Space/Time Complexity

Question 1

Constant Time Complexity

Answer 1

O(1)

The amount of time taken to complete an algorithm is independent from the number of elements inputted

Question 2

Linear Time Complexity

Answer 2

O(n)

The amount of time taken to complete an algorithm is directly proportional to the number of elements inputted

Question 3

Polynomial Time Complexity

Answer 3

O(n n)

The amount of time taken to complete an algorithm is directly proportional to the elements inputted to the power of n

For example :
O(n2)

The amount of time taken to complete an algorithm is directly proportional to the square of the elements inputted

Question 4

Exponential Time Complexity

Answer 4

O(2n)

The amount of time taken to complete an algorithm will double with every additional item

Question 5

Logarithmic Time Complexity

Answer 5

O(log n)

The time taken to complete an algorithm will increase at a smaller rate as the number of elements inputted

Question 6

Time Complexity

Answer 6

A measure of the amount of time needed by an algorithm to solve a particular problem of a given input size

Question 7

Space Complexity

Answer 7

A measure of the amount of memory space needed by an algorithm to solve a particular problem of a given input size

Question 8

Big O Notation

Answer 8

A way of classifying algorithms based on their complexity by setting an upper bound for the worst case time or space complexity as a mathematical function of input size