js时间-价格-排序案例-----冒泡排序实例(2)

                }
            }
        }
        if(type==3){
            var temp;
            for(var i =0;i<sort.sortdata.length;i++){
                for(var j =0;j<sort.sortdata.length- i - 1;j++){
                    if(parseInt(sort.sortdata[j].lowPrice) <= parseInt(sort.sortdata[j + 1].lowPrice)){
                        temp = sort.sortdata[j + 1];
                        sort.sortdata[j + 1] = sort.sortdata[j];
                        sort.sortdata[j] = temp;
                    }
                }
            }
        }
        if(type==4){
            var temp;
            for(var i =0;i<sort.sortdata.length;i++){
                for(var j =0;j<sort.sortdata.length- i - 1;j++){
                    if(parseInt(sort.sortdata[j].lowPrice) >= parseInt(sort.sortdata[j + 1].lowPrice)){
                        temp = sort.sortdata[j + 1];
                        sort.sortdata[j + 1] = sort.sortdata[j];
                        sort.sortdata[j] = temp;
                    }
                }