Question

How many times will the QuickSort method be called and executed (including the initial call) when performing QuickSort(L), where L is the list/array containing the elements [8, 1, 2, 4, 9, 6]?

For this problem, assume QuickSort is implemented using the last position as the pivot element, as shown in the pseudocode below.

QuickSort(L)
   if length of L <= 1, return L

   pivot = last element in L
   Smaller = empty list
   Larger = empty list
   count_pivot = 0
   for each x in L:
      if x < pivot, append to Smaller
      if x > pivot, append to Larger
      if x == pivot, count_pivot++
   QuickSort(Smaller)
   QuickSort(Larger)
   copy Smaller into the first positions of L
   copy pivot into the next position(s) of L, count_pivot times
   copy Larger into the remaining positions of L

Answer 1

quickSort (18,1,2,4,9,6] pirot pivot awek cock cu un amie kant to be Bessert op Quick Sand () cukord {[) sie kelle Burbesard (EU) Ouk Sorul (13) Total Call a 9 times