Louise dashboard Question 7 In quick sort, the number of partitions into which the file of size n is divided by a selected record is Not yet answered Marked out of 1.50 Flag question Select one O a.4 O b.n/2(n-1) O c.2 d. 2(n-1) Question 8 For the improvement of efficiency of quick sort the pivot can be Not yet answered Select one: Marked out of 150 O a. The first element Flag question O b. The mean element O c. The last element Od None of the above UYGD Question 9 Not yet answered How many numbers of comparisons are required in insertion sort to sort a file if the file is sorted in reverse order? Marked out of 150 Flag question Select one: O a na O b. 2n O c2n-1 od n2/2 Question 11 Not yet answered If you have two algorithms A and B that solve the same problem, Algorithm A is bigger in size than algorithm B. Which of the following statements is true? Marked out of 1,50 Select one: Flag question O a. Algorithm A must be more complex than algorithm B. O b. Algorithm B must be more complex than algorithm A O c. Algorithm A may be more complex than algorithm B. O d. Algorithm A must be same complex as algorithm B. Question 19 Not yet answered Considering the following recursive time, compute the final (n) and T(n) complexity using forward or backward substitution. T(n)-2 when n=1 T(n)= T(n-1)+2 when > Marked out of 200 p Flag question Select one: O a. T(n) = 2n+2 (n) O b. T(n) - 2n, (2n) O c.T(n) - 2n. O(n) d, T(n) = n, on) Clear my choice One of the following represents the order of algorithms from the most efficient to the least: Question 18 Not yet answered Marked out of 150 Flag question Select one: O a log(n), n+100log(n), nlog(n) O b. 10n+50n+500, nlog(n) 300log(n) Oc2", no O d. n +5n, 6n