Sorting. Can I code BubbleSort more efficiently?

Question

I would like advice on how to code BubbleSort more efficiently. Especially, I would like to not use an extra integer (here called sortHelp) for swapping the entries in the array, if possible.
Thank you.
https://code.sololearn.com/caV0QB2RWsiB/?ref=app

Answer 1

You are doing the most efficient thing here.

You can get rid of the temporary int, if you are willing to change your array from `int[]` to `Integer[]`:

Integer[] listToSort = {...}

...
java.util.Collections.swap(java.util.Arrays.asList(listToSort), i, i+1);

But then the `swap` function just does what you are doing so it's not more efficient, and it looks cluttered.

You can also swap integers using the "XOR swap" (google it) but that isn't really more efficient either.

So what you are doing is fine.