Complexity Analysis Station [2]

What is asymptotic complexity in the following void function?

• O(n^5)

• O(n^3)

• O(n^2)

• O(1)

What is the asymptotic complexity of the following function?

• O(n^2)

• O(nlogn)

• O(n^2logn)

• O(n)

What is asymptotic complexity in the following function?

• O(n^2)

• O(nlogn)

• O(n^2logn)

• O(n)

What is asymptotic complexity in the following function? If arrayA.length() not equal to arrayB.length().

• O(a^2)

• O(b^2)

• O(ab)

• O(1)

What is asymptotic complexity in the following function? If arrayA.length() not equal to arrayB.length().

• O(a^2)

• O(b^2)

• O(ab)

• O(1)

Which of the following are equivalent to O(n)?

• O(n + p), where p < n/2

• O(2n)

• O(n + log n)

• All of the above

What is the main disadvantage of a binary search compared to a linear search?

• It requires the data to be in order
• It requires more memory
• It does not execute as quickly with larger data sets
• Not all CPUs are capable of executing the algorithm