//简便方法
var arr = [{code:1,value:1},{code:2,value:3},{code:3,value:2}];
arr = arr.sort((a,b) => { return a.value - b.value });
console.log(arr);
var arr = [{code:1,value:1},{code:2,value:3},{code:3,value:2}];
// sort() 数组对象排序 其原理是冒泡排序,即比较相邻的元素,如果第一个比第二个小,就交换他们两个。
var compare = function(obj1,obj2){
var val1 = obj1.value;
var val2 = obj2.value;
if(val1 > val2){
return 1;
}else if(val1 < val2){
return -1;
}else{
return 0;
}
}
var sortArr = arr.sort(compare);
console.log(sortArr);
var arr = [{code:1,value:1},{code:2,value:3},{code:3,value:2}];
// sort() 数组对象排序 其原理是冒泡排序,即比较相邻的元素,如果第一个比第二个大,就交换他们两个。
var compare = function(obj1,obj2){
var val1 = obj1.value;
var val2 = obj2.value;
if(val1 < val2){
return 1;
}else if(val1 > val2){
return -1;
}else{
return 0;
}
}
var sortArr = arr.sort(compare);
console.log(sortArr);