Optimized Bubble Sort (Java)

I would like to know how else I can optimize bubble sort so that it overlooks elements that have already been sorted, even after the first pass. Eg. [4, 2, 3, 1, 5, 6] –> [2, 3, 1, **4, 5, 6**] …