JavaScript排序算法——插入排序

<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
<title>插入</title>
<!--<link rel="stylesheet" type="text/css" href="../style/fdt.css" />-->
<script type="text/javascript" src="../js/jquery-1.6.2.min.js"></script>
<script type="text/javascript" src="../js/jquery.easydrag.handler.beta2.js"></script>
<script type="text/javascript">

    $(document).ready(
        function() { 
            
            var array_1 = [9,8,7,6,5,4,3,2,1];
            alert(array_1);
            /*insertSort*/
            alert(insertSort(array_1));
        }
    ); 

</script>
    

<script type="text/javascript">
    function insertSort(array){
        var i = 1,j, step, key, len = array.length;

        for (; i < len; i++) {

            step = j = i;
            key = array[j];

            while (--j > -1) {
                if (array[j] > key) {
                    array[j + 1] = array[j];
                } 
                else {
                    break;
                }
            }
            array[j + 1] = key;
        }
        return array;
    }

</script>



<style type="text/css">
    
    * { padding:0; margin:0; }

    body {
        padding: 100px;
        font-size: 15px; 
    }

    


</style>

</head>




<body>
    <div>快速排序</div>
</body>
</html>
原文地址:https://www.cnblogs.com/tonglin0325/p/5179399.html