javascript当中排序比较器用法

例 1.5(排序比较器)

<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"
        "http://www.w3.org/TR/html4/loose.dtd">
<html>
<head>
    <meta http-equiv="content-type" content="text/html; charset=utf-8"/>
    for teach.
    <script type="text/javascript">
        function sortNumberqixy(a, b)
        {
            /*  马克-to-win
            returned value type: Array object
            JavaScript syntax: - myArray.sort()
            - myArray.sort(aComparator)
            Argument list: aComparator A function object that will compare two items and returns a flag indicating their order in the sort collating sequence.
            Sort the elements in an array.
            You must make sure the comparator returns one of the following three values:
            Negative integer(qixy: not a boolean.) - signifies that the first argument is less than the second.(qixy the whole final result is that small number is in front.)
            Zero - Signifies that both arguments are the same.
            Positive integer - Signifies that the first argument is larger than the second.
            qixy: int=parseInt(String)
            */
            if (parseInt(a) < parseInt(b)) return -5;
            if (parseInt(a) > parseInt(b)) return 4;
            else return 0;
            /* the following is a simple method */
            //return a - b
        }
        var arr = new Array(3)
        arr[0] = "9"
        arr[1] = "6"
        arr[2] = "6"
        arr[3] = "26"
        arr[4] = "10001"
        arr[5] = "2"
        document.write(arr + "<br />");
        /* note that if we don't give the comparator, sort will use the default way to sort. then it will sort according to String,then its order is 10001,2,26,6,6,9 */
        document.write("排序之后:" + arr.sort());
        document.write("排序之后:" + arr.sort(sortNumberqixy));
    </script>
</head>
<body>

</body>
</html>

更多请见:http://www.mark-to-win.com/tutorial/js_2_SortComparator.html

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

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

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值