<p>(CYCLOMATIC/MCCABE COMPLEXITY)</p><p>Consider the following quicksort sorting algorithm:</p><p><strong>QUICKSORT(A, p, r)</strong></p><p style="margin-left:30px;"><strong>if p < r</strong></p><p style="margin-left:60px;"><strong>then q ? PARTITION(A, p,r)</strong></p><p style="margin-left:90px;"><strong>QUICKSORT(A, p, q ? 1)<br/>QUICKSORT(A, q + 1, r)</strong></p><p><strong>where the PARTITION procedure