what is the time complexity?

static void bubblesort$($int$[]$ arr$)\{$

int n $=$ arr.length;

for $($int i $=0$; i $<$ n $-1$; i$++)\{$

System.out.print$($arr$[$i$]+"$:$\backslash$t $")$;

for$($int j$=1$; j $<($n$-$i$)$; j$++)\{$

System.out.print$($arr$[$j$]+",")$;

if $($arr$[$j$-1]>$ arr$[$j$])\{$

int temp $=$ arr$[$j$-1]$;

$$ arr$[$j$-1]=$ arr$[$j$]$;

$$ arr$[$j$]=$ temp;

$\}$

$\}$

$$ System.out.println$()$;

$\}$

$\}$