Big O notation

Question 1

time complexity

Answer 1

shows how much time it requires to solve a particular problem

Question 2

what is time complexity measured using

Answer 2

Big O notation which shows the effectiveness of an algorithm

Question 3

O(1)

Answer 3

**Constant time complexity **

the time taken to complete an algorithm is independant from the number of elements inputed

Question 4

O(n)

Answer 4

linear time complexity- the time taken to complete an algorithm is directly proportional to the number of elements inputted

Question 5

O(n^2)

Answer 5

polynomial time complexity- the time taken to complete an algorithm is directly proportionate to the square of elements inputted

Question 6

O(2n)

Answer 6

**exponential time complexity ** - the amount of time taken to cmoplete an algorithm will double each time an item is added

Question 7

O(log n)

Answer 7

**logarithmic time complexity ** - the time taken to complete an algorithm will increase at a smalelr rate as the number of elements is inputted

Question 8

binary search time complexity is…

Answer 8

(o(log(n))

Question 9

linear search time complexity is…

Answer 9

o(n)

Question 10

bubble sort time complexity is

Answer 10

0(n^2)