冒泡算法

<!DOCTYPE html>
<html lang="en">
<head>
    <meta charset="UTF-8">
    <title>Document</title>
</head>
    <body>
        <button onclick="dj()">点击</button>
    </body>
    <script>
    var a=[10,20,5,13,7];
    function dj(){
     var k=0;
    
    for(var b=0;b<5;b++){
        for(var q=0;q<5;q++){
            if(a[q]>a[q+1]){
                k=a[q];
                a[q]=a[q+1];
                a[q+1]=k;

            }
        }
    }
    
    for(var n=0;n<5;n++){
        document.write(a[n]+"<br/>"+"<br/>"+"<br/>"+"<br/>");
    }
}


    </script>   
</html>
posted @ 2018-05-09 07:15  dongdongyang  阅读(127)  评论(0)    收藏  举报