Time complexities

Question 1

Describe O(n) notation

Answer 1

Time complexity of O(n) means the time taken in the worst case is proportional to n, where doubling the input size results in a twofold increase in execution time.

Question 2

Describe O(n^2)

Answer 2

Time complexity of O(n^2) means that time taken in the worst case increases with the square of n, where doubling input size will lead to 4 fold increase in execution time.

Question 3

Describe O(log n)

Answer 3

Time complexity of O(log n) means that the time taken in the worst case scenario is proportional to log n, where doubling the input size results in a sqrt(2) increase in execution time.

Question 4

Describe O(1) notation

Answer 4

Time complexity of O(1) means that regardless of data size, execution time will be consistent.