QUICKSORT(A, p, r) if p < r then q - PARTITION(A, p, r) QUICKSORT(A, p. q - 1) QUICKSORT(A, q + 1, r) where the PARTITION procedure is as follows: PARTITION (A, p, r) x - A[r] i-p-1 for j - p to r - 1 do if A[j] ≤ x then i + i + 1 exchange A[i] → A[j] exchange A[i+1] → A[r] return i + 1 Draw the flowchart of the above algorithm. • Draw the corresponding graph and label the nodes as n1, n2, ... and edges as e1,e2, ... • Calculate the cyclomatic complexity of the above algorithm

Suppose we wish to sort the following values: 84, 22, 19, 11, 60, 68, 31, 29, 58, 23, 45, 93, 48, 31, 7. Assume that: we have three pages of memory for sorting; we will use an external sorting algorithm with a 2-way merge; a page only holds two values. We do not use double buffering and we use quick sort in pass 0 to produce the initial runs. For each sorting pass, show the contents of all temporary files except that you should fully utilize the buffers by sorting every 3 pages into a run in pass 0. Could you show step by step detailed explaination for this?

use the partition function given when writing quicksort algorithm

t/f

All parts of Q11 please.

Implement the following algorithms in Java:The pseudocode for QUICKSORT introduced in (slide 14), includingprocedure PARTITION implementing right-most element pivot selection (slide 13). Slide 13:PARTITION(A,p,r)  x := A[r]  i := p – 1  for j = p to r - 1    if A[j]  x      i := i + 1      SWAP(A[i],A[j])  SWAP(A[i+1],A[r])   return i + 1 Slide 14:QUICKSORT(A,p,r)  if p < r    q := PARTITION(A,p,r)    QUICKSORT(A,p,q-1)    QUICKSORT(A,q+1,r)