javascript-------冒泡排序

//冒泡排序实现
function bubleSort(myArray)
{
    var temp=0;
    for (var i = 0; i < myArray.length; i++) {
        for (var j = 0; j < myArray.length-i; j++) {
            if(myArray[j]>myArray[j+1])
            {
                temp=myArray[j+1];
                myArray[j+1]=myArray[j];
                myArray[j]=temp;
            }
        };
    };

    return myArray;
}
//测试排序
function testBubleSort()
{
    var myArray=initArray();
    var myArrayAfterSort=bubleSort(myArray);
    for (var i = 0; i < myArrayAfterSort.length; i++) {
        console.log(myArrayAfterSort[i]);
    };
}
//初始化数组
function initArray()
{
    var myArray=[3,6,2,9,1];
    return myArray;
}

testBubleSort();