RANDOMIZED$-$PARTITION$($A$,$p$,$r$)$

$1$ i $=$ RANDOM$($p$,$r$)$

$2$ exchange A$[$r$]$ with A$[$i$]$

$3$ return PARTITION$($A$,$p$,$r$)$

RANDOMIZED$-$QUICKSORT$($A$,$ p$,$ r$)$

if $($p $<$ r$)$

q $=$ RANDOMIZED$-$PARTITION$($A$,$ p$,$ r$)$

RANDOMIZED$-$QUICKSORT$($A$,$ p$,$ q $-1)$

RANDOMIZED$-$QUICKSORT$($A$,$ q $+1,$ r$)$

If we apply RANDOMIZED$-$QUICKSORT$($A$,1,200)$ on an array A with $200$ elements, how many times do we call RANDOMIZED$-$PARTITION in the best case?