Data Structures/Algorithms

Please make needed corrections

3. Consider QuickSort on the array A[1:n] and assume that the pivot element x (used to split the array A[lo:hi] into two portions such that all elements in the left portion A[lo:m] are x and all elements in the right portion A[m:hi] are 2x) is the first element of the array to be split (i. e., A[lo]). Construct an infinite sequence of numbers for n and construct an assignment of the numbers 1...n to the n array elements that causes QuickSort, with the stated choice of pivot, to (a) execute optimally (that is A[lo:m] and A[m:hi] are always of equal size) (b) execute in the slowest possible way. If the puotis always te last element in tee list the best poss ble outcome wil beu the pivot in the medien of tre list. Hence, we want the last element on tu kst as the medran of te While list. when 1 ns infim, ty arrey as: ALL:x] wher Since, the doman of n 15: we should defme the n approaches in fmiky x=nl2. the list will akways be splt n half. Calogin). Fortermore The time cemplexity Lwould tuen be 36) There are three lwarst pors. fle scenarias for quicksort: The 1st may alrealy be Jorted The list is Sorted, But in reverse order So All elements m the Axt are the same. SIce we wat to sort the 1:st from least to greatest, this means all the lesser elenets from the piunt goon to the left Cud the greakei ele ments fom the pivot go to the rignt. The danan is defined of n as! 1