傻逼，面試緊張冒泡算法都寫不出來，說我自己

package com.atsico.pkg0819;

import org.junit.Test;

import java.util.Arrays;

public class MainDemo {

public static void main(String[] args) {

}

@Test
public void test_() {
    int tempVal = 0;
    int[] iArr = new int[]{2, 1, 3, 6, 8, 0, 7, 5, -1};
    for (int i = 0; i < iArr.length; i++) {
        for (int j = i + 1; j < iArr.length; j++) {
            if (iArr[i] > iArr[j]) {
                tempVal = iArr[j];
                iArr[j] = iArr[i];
                iArr[i] = tempVal;
                tempVal = 0;
            }
        }
    }

    System.out.println("冒泡排序：");
    for (int mem : iArr)
        System.out.print(mem + " ");
}
           

}