var oldArr =[2,3,5,4,3,2,6,8,5,4,6,2]
console.log(Array.from(newSet(oldArr)));var newArr =[]var flag =truefor(var i =0; i < oldArr.length; i++){
flag =true// console.log(oldArr[i]);// 进行判断for(var j =0; j < newArr.length; j++){if(newArr[j]== oldArr[i]){
flag =false}}if(flag){
newArr.push(oldArr[i])}}
console.log(newArr);
冒泡排序
将数组[10,1,35,61,89,36,55]冒泡排序,从小到大(用函数)
var arr =[10,1,35,61,89,36,55]// 1、循环for(var i =0; i < arr.length; i++){for(var j = i +1; j < arr.length; j++){if(arr[i]> arr[j]){var temp;
temp = arr[i]
arr[i]= arr[j]
arr[j]= temp
}}}
console.log(arr);// var arr = [5, 4, 3, 2, 1]
console.log(arr.sort());