js排序集合

//arr1 arr2 arr3 3种排序最终效果都是一直的
arr1(arr) {
  const len = arr.length;
  for (let i = 0; i < len - 1; i++) {
    for (let j = i + 1; j < len; j++) {
      if (arr[j] < arr[i]) {
        [arr[j], arr[i]] = [arr[i], arr[j]];
      }
    }
  }
  return arr;
},
arr2(arr) {
  const len = arr.length;
  for (let i = 0; i < len - 1; i++) {
    let index = i;
    for (let j = i + 1; j < len; j++) {
      if (arr[j] < arr[index]) {
        index = j;
      }
    }
    if (index !== i) {
      [arr[i], arr[index]] = [arr[index], arr[i]];
    }
  }
  return arr;
},
arr3(arr) {
  const len = arr.length;
  for (let i = 1; i < len; i++) {
    let j = i - 1;
    const value = arr[i];
    while (arr[j] > value && j >= 0) {
      arr[j + 1] = arr[j];
      j--;
    }
    arr[j + 1] = value;
  }
  return arr;
}
let arr=[11,5,7,3,14,9]
console.log(this.arr1(arr))//[3, 5, 7, 9, 11, 14]
console.log(this.arr2(arr))//[3, 5, 7, 9, 11, 14]
console.log(this.arr3(arr))//[3, 5, 7, 9, 11, 14]
//数组以某个属性排序
let arr=[{name:'大米',index:2},{name:'小米',index:3},{name:'麦子',index:1},{name:'玉米',index:0}]
fun(val) {
	return function (a, b) {
		return a[val] - b[val];
	}
}
arr.sort(this.fun('index'))
console.log(arr)//[{name:'玉米',index:0},{name:'麦子',index:1},{name:'大米',index:2},{name:'小米',index:3}]

//数组中以某个属性排序,且属性值相同,则以第二个属性进行排序
let arr=[{name:'大米',index:2,num:1},{name:'小米',index:3,num:2},{name:'麦子',index:1,num:2},{name:'玉米',index:0,num:3}]
fun(v1,v2) {
	return function (a, b) {
		if(a[v1] == b[v2]){
			return a[v2] - b[v2];
		}else{
			return a[v1] - b[v1];
		}
	}
}
arr.sort(this.fun('num','index'))
console.log(arr)//[{name:'大米',index:2,num:1},{name:'麦子',index:1,num:2},{name:'小米',index:3,num:2},{name:'玉米',index:0,num:3}]

//数组根据中文进行排序
let arr=[{name:'大米',index:2},{name:'小米',index:3},{name:'麦子',index:1},{name:'玉米',index:0}]
fun(val){
	return function (a, b) {
		return a[val].localeCompare(b[val], 'zh-Hans-CN');
	}
}
arr.sort(this.fun('name'))
console.log(arr)//[{name:'大米',index:2},{name:'麦子',index:1},{name:'小米',index:3},{name:'玉米',index:0}]

//数组根据26字母排序 A最前面
let arr = ['A','G','B']
fun(){
	return function (a, b) {
		return (a + '').localeCompare(b + '');
	}
}
arr.sort(this.fun())
console.log(arr)//['A','B','G']

//数组某个值根据26字母排序 A最前面
let arr = [{name:'A'},{name:'g'},{name:'b'}]
fun(val){
	return function (a, b) {
		return (a[val] + '').localeCompare(b[val] + '');
	}
}
arr.sort(this.fun('name'))
console.log(arr)//[{name:'A'},{name:'b'},{name:'g'}]

//获取对象数组中某个值得最大值、最小值
arr = [{name:'大米',index:2,age:1},{name:'小米',index:3,age:2},{name:'麦子',index:1,age:10},{name:'玉米',index:0,age:11}]
let mx = Math.max.apply(Math,arr.map(item => { return item.index })) //3 index最大值3
let mi = Math.min.apply(Math,arr.map(item => { return item.age})) //1	age最小值1
  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值