X$1302$: Bubble Sort Best Case

Consider the default Bubble Sort algorithm shown below. Under which condition would this algorithm produce the best case performance?

void bubbleSort $($int nums $[])$

f

for $($int $i=0$;$i$ nums. length $-1$;$i++)$

for $($int $j=0$;$j$ nums. length $-1$;$j++)$

$//$ compare two adjacent elements

if $($nums $[$j$]>$ nums $j+1)\{$

$//$ swap elements

int temp $=$ nums $j$;

nums $[j]=$ nums $j+1$;

nums $[j+1]=$ temp;

$\}$

$\}$

Your Answer:

Time remaining $-00$:$46$:$13$

Attempts remaining: $25$

Select one answer:

list is already sorted