O(1)

O(2n)

O(n)

O(n2)

An algorithm requires a total of 3n³ + 2n² – 3n + 4 visits. In big-Oh notation, the total number of visits is of what order?

for i in range(3) :

   for j in  range(5) :

      if i % 2 ==  j % 2 :

         print("*", end="")

      else :

         print(" ", end="")

   print()

i = 0

while i != 9 :

   print(i, end = " ")

   i = i + 2

i = 1

sum = 0

while i <= 11 :

   sum = sum + i

   i = i + 1

print("The value of sum is", sum)

A linear search has an advantage over other algorithms because of its ________.

In the best-case scenario in linear search with an array, how many comparisons are needed?