There are sorted sequences L1 and L2, with 5 and 4 elementsrespectively.
How many comparisons will it take to merge L1 and L2 in the bestcase? How many for worst case? Explain your answers.
b)Let [54, 26, 93, 17, 77, 31, 44, 55, 20] be a sequence ofnumbers and the first element, 54, be the pivot value. What is thelist after one round of partitioning with quicksort?Schedule
Asked Jan. 02, 2017