Answer Happy

You cannot write a recursive algorithm to implement the sequential search algorithm. True False

The speed of a computer can affect the time an algorithm takes to perform, but it does not affect the number of key comparisons required. True False

In analyzing a sorting algorithm, you look at the number of key comparisons as well as the number of data movements. True False

The behavior of the merge sort algorithm is always O(n). True False

and the number of For selection sort, the number of comparisons is always assignments is 0 ( On), C(n) O(nlog2n), O(n) O Q(nº), C(n) O O(na), O(na)

The maximum number of comparisons made by the merge sort algorithm is O O(n) O(nlog2n) O O(nm) O O(na)