algorithm 21)Let array A= {20, 3, 10, 9, 17, 12, 8, 13, 2, 5, 11} after using the Lomuto partition to find the median the split point after second iteration is

22)In BF assignment job problem, the time complexity is

23)The time factor when determining the efficiency of the algorithm is measured by

Select one:

a. Counting the number of statements

b. Counting the kilobytes of algorithm

c. Counting the number of essential operations

d. Counting microseconds 27)The time factor when determining the efficiency of the algorithm is measured by

Select one:

a. Counting the number of statements

b. Counting the kilobytes of algorithm

c. Counting the number of essential operations

d. Counting microseconds 28)After generating the AVL tree from the list: 7, 10, 15, 25, 22, 13, 11, 5, 9, 3, 6, 1

The last rotation is

a. RR rotation

b. LR rotation

c. RL rotatio 29)The best case of selection sort is

Select one:

a. No best case

b. When the array is unsorted

c. When no swaps is done

d. When the array is sorted 30)The worst time complexity of finding the minimum item in the binary search tree is

a. O(n)

b. O(Log n)

c. O(n log n)

d. O(1) 34)Assume the list is sorted by one of the comparison sorts. And after some iterations the list becomes:

12 16 7 10 8 9 13 15. Then we use: 35)The sort that divides the problem size according to the index of the items is