just answer no need for explanation:

$1.$ We have an array with more than $2$ elements. If it is not sorted, then there must be at least two elements that are not in place.

Group of answer choices

True

False

$2.$ When we compare the growth functions of two algorithms, if the limit of the ratio of these two functions does not exist, do we still have a chance to find out which one is faster?

Group of answer choices

yes

no

$3.$ If an array does not have any inversion, which of the following statements is correct?

Group of answer choices

This array is in descending order.

This array is in ascending order.

This array is not ordered.

$4.$ An efficient algorithm does not have to perform well for the relatively small problem sizes.

Group of answer choices

True

False

$5.$ When we calculate the limit of the ratio of two growth functions, we can always apply the l'Hospital's rule.

Group of answer choices

True

False

$6.$ When we apply the Brute Force Algorithm on the String Matching problem, it is known that the text part has $1000$ characters, and the pattern part has $10$ characters. How many substrings with $10$ characters can we find in the text part?

$7.$ To solve the String Matching problem, do you think that there exists a faster algorithm than the Brute Force Algorithm?

Group of answer choices

yes

no

$8.$ What is the growth function of the running time efficiency function for the bubble sort?

Group of answer choices

n

log n

n log n

n$^2($meaning n square$)$

$9.$ Suppose an array is not ordered. What is the minimum number of inversions in this array?

$10.$ An exponential function with the base greater than $1$ always has higher order of growth than that of any polynomial function.

Group of answer choices

True

False