js实现的插入排序算法

var insertionSort = function (arr) {
    var length = arr.length;
    var temp;
    var j;
    for(var i=1;i<length;i++){
        j=i;
        temp=arr[i];
        while(j>0&&arr[j-1]>temp){
            arr[j]=arr[j-1];
            j--;
        }
        arr[j]=temp;
    }

    return arr;
}
var arr = [1, 6, 2, 5, 9, 2, 0,9];
console.log(arr.toString());
console.log(insertionSort(arr).toString());