冒泡排序，根据数组中属性排序，插入排序，数组去重，判断数组中某一个值是否存在（includes）

冒泡排序：

var arr = [1,6,5,10];
var t;
for(var i = 0 ; i < arr.length; i++){
        for(var j = i + 1 ; j < arr.length ; j++){
            if(arr[i] > arr[j]){
                t = arr[i];
                arr[i] = arr[j];
                arr[j] = t;
            }
        }
    }
console.log(arr);

根据数组中属性排序：

var toot = [{name:'qw',age:0},{name:'as',age:18},{name:'jj',age:8}];
function compare(prop){
     return function (a,b){
         var value = a[prop];
         var value2 = b[prop];
         return value - value2
     }
 }
 console.log(toot.sort(compare('age')));

数组插入排序：

    var Arr = [0,4,2,6,7,8,2,14,57,8,99,0,45,32,12,1,1,1,1,45,0,9,8,7,6,5,4,3,2,115,67,68,56,55,43,21];
    function setSort(iArr) {
        var isarr = [iArr[0]];    //将原数组写入新数组，循环之后还要做判断
        for(var i = 1 ; i < iArr.length; i++){
            for(var j = 0 ; j < i; j++){
                if(iArr[i] <= isarr[j]){
                    isarr.splice(j, 0, iArr[i]);
                    break
                }else if(j === i-1){
                    isarr.push(iArr[i]);
                }
            }
        }
        return isarr;
    }
var tot = setSort(Arr);
console.log(tot);
//输出值为：[0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 3, 4, 4, 5, 6, 6, 7, 7, 8, 8, 8, 9, 12, 14, 21, 32, 43, 45, 45, 55, 56, 57, 67, 68, 99, 115]

数组去重：

var arr = [0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 3, 4, 4, 5, 6, 6, 7, 7, 8, 8, 8, 9, 12, 14, 21, 32, 43, 45, 45, 55, 56, 57, 67, 68, 99, 115]

var tot = [];

for(var i = 0; i< arr.length; i++){
    if(tot.indexOf(arr[i]) == -1){
        uui.push(tot[k])
    }
}

console.log(tot);
//输出结果 [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 12, 14, 21, 32, 43, 45, 55, 56, 57, 67, 68, 99, 115]

判断数组中某一个值是否存在：

var arr = [1,6,5,10];

var ret = arr.includes(5);

console.log(ret)    //true
//如果arr数组中6存在，则返回true，否则返回false