Big O Searching Algorithm

Question 1

Linear Search Big O time complexity

Answer 1

BEST CASE - O(1)
AVERAGE CASE -
O(n)
WORST CASE-
O(n)

Question 2

Binary Search Array

Answer 2

BEST CASE - O(1)
AVERAGE CASE- O(log n)
WORST CASE-
O(log n)

Question 3

Binary Search Tree

Answer 3

BEST CASE - O(1)
AVERAGE CASE-O(log n)
WORST CASE- O(n)

Question 4

Binary Search array

Answer 4

BEST CASE- O(n)
AVERAGE CASE-O(log n)
WORST CASE-
O(log n)

Question 5

Name and notation

Answer 5

O(1) = Constant
O(log n) = Logarithmic
O(n) = Linear
O(n log N) = Linearithmic
O(n^2) = Polynomial
O(2^n) = Exponential
O(n!) = Factorial