Given is the code for the partition method of Quick Sort:

int partition$($int array$[],$ int low, int high$)$

$\{$

int pivot high$]$;

int up $=$ low, down $=$ high;

while$($up $$ down$)$

$\{$

for $($int $j=$ up; $j$ high; $j++)$

$\{$

if $($array$[$up$]>$ pivot$)$

break;

up$++$;

$\}$

for $($int $j=$ high; $j>$ low; $j--)$

$\{$

if$($array$[$down$]$ pivot$)$

break;

down$--$;

$\}.$

if$($up $$ down$)$

$\}$

swap$($&array $[$up$],$ &array $[$down$])$;

swap$($&array $[$low$],$ &array$[$down$])$;

$\}$

Which statement below is true if the array size is $n?$

The worst case time complexity of this method is $O(n)$

The worst case time complexity of this method is $O(n^{{?}^{{?}^{?}}}2)$

The worst case time complexity of this method is $O(nlogn)$