1)

The best case of insertion sort is

Select one:

a.

When the array is not norted

b.

when the array has distinct items

c.

When the array is sorted

d.

No best case

2)

Let array A[] = {20, 22, 33, 36, 38, 49, 50, 61,63, 73, 74, 77, 85, 90, 97} and the search key K =90. In the interpolation search we find the key after

a.

3 iterations

b.

1 iteration

c.

2 iterations

d.

4 iterations

3)

The number of comparisons is required in insertion sort to sort an array if it is already sorted is n-1

Select one:

True

False