The Bubble Sort implementation has the following inner for loop:

for (int j=n-1; j>i; j--)

Consider the effect of replacing this with the following statement:

for (int j=n-1; j>0; j--)

Would the new implementation work correctly? Would the change affect the asymptotic complexity of the algorithm? How would the change affect the running time of the algorithm?