<!DOCTYPE html>
<html>
<head>
<meta charset="UTF-8">
<title>数组排序</title>
</head>
<body>
</body>
<script type="text/javascript">
var a=[{package:"8",approval:"H20051661",number:"518",pack:"600",price:"17.59",expiry:"2018-01-12"},
{package: "8", approval: "H20051661",number:"518",pack:"600",price:"20",expiry:"2017-01-12"},
{package: "8", approval: "H20051661",number:"518",pack:"600",price:"17.58",expiry:"2018-07-12"},
{package: "8", approval: "H20051661",number:"518",pack:"600",price:"1",expiry:"2018-01-19"},
{package: "8", approval: "H20051661",number:"518",pack:"600",price:"1",expiry:"2018-09-12"},
{package: "8", approval: "H20051661",number:"518",pack:"600",price:"2",expiry:"2006-01-12"}
]
function quickSort(arr,name,snum){
//如果数组<=1,则直接返回
if(arr.length<=1){return arr;}
var pivotIndex=Math.floor(arr.length/2);
//找基准，并把基准从原数组删除
var pivot=arr.splice(pivotIndex,1)[0];
var middleNum=pivot[name];
// 定义左右数组
var left=[];
var right=[];
//比基准小的放在left，比基准大的放在right
if(snum){
for(var i=0;i<arr.length;i++){
if(Number(arr[i][name])<=Number(middleNum) ){
left.push(arr[i]);
}else{
right.push(arr[i]);
}
}
}else{
for(var i=0;i<arr.length;i++){
if(arr[i][name]<=middleNum){
left.push(arr[i]);
}else{
right.push(arr[i]);
}
}
}
//递归,返回所需数组
return quickSort(left,name,snum).concat([pivot],quickSort(right,name,snum));
}
// console.log(quickSort(a,"expiry",false));按照日期返回的排序数组
// console.log(quickSort(a,"price",true));按照价格返回的排序数组
// console.log(show(quickSort(a,"expiry",false),"expiry"));
console.log(show(quickSort(a,"price",true),"price"));
function show(arr,name) {
var str = "";
for (var i = 0; i < arr.length; i++) {
str+=arr[i][name]+",";
}
return str;
}
</script>
</html>
转载于:https://www.cnblogs.com/gshufan/p/6374791.html
1万+
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
