冒泡排序改善

/*
 *wushuaiying
 * 2021-4-18
 * 冒泡排序2
 */

package Maopao;
import java.util.Arrays;
public class maopao2 {
    public static void main(String[] args) {
        int a[]={4, 7, 9, 44, 1, 2,};
        int sort[]=sort(a);
            System.out.print(Arrays.toString(sort));
        }
        public static int[] sort(int[]a) {


        for (int j = 0; j < a.length - 1; j++) {
            boolean flag = false;
            for (int r = 0; r < a.length - 1; r++) {                if (a[r] > a[r + 1]) {
                    int temp = a[r];
                    a[r] = a[r + 1];
                    a[r + 1] = temp;
                    flag = true;
                }
            }

        if (flag == false) {
            break;
        }

        }
        return a;
        }
    }

```[1, 2, 4, 7, 9, 44]
进程已结束，退出代码为 0