Time Complexity

Question 1

Time stays same no matter how many elements

eg: Array[x] / array.push

Answer 1

(1) Constant complexity O(1)

Question 2

Time increases as number of elements increases

eg: for loop

Answer 2

(3) Linear complexity O(n)

Question 3

Time increases exponentially as elements increase

eg: nested for loops

Answer 3

(5) Quadratic complexity O(n^2)

Question 4

Time complexity is reduced in some way by limiting or dividing the number of elements accessed
(eg: for loop with divide by 2 / binary search)

Answer 4

(2) Logarithmic complexity O(log n)

Question 5

Time complexity increases like an exponential loop but is limited by dividing the number of elements
(eg: divide and conquer on an n^2 algorithm )

Answer 5

(4) nLogN O(n log n)