zoukankan      html  css  js  c++  java
  • 冒泡排序

    初级版本冒泡

    <!DOCTYPE html>
    <html lang="en">
    <head>
          <meta charset="UTF-8">
          <meta name="viewport" content="width=device-width, initial-scale=1.0">
          <meta http-equiv="X-UA-Compatible" content="ie=edge">
          <title>Document</title>
    </head>
    <body>
          <script>
    var arr=[5,4,3,2,1,3]
    
          for( var j = 0; j<arr.length; j++){       
    
               for( var i = 0; i < arr.length; i++ ){
                      if( arr[i] > arr[i+1]){
    
                            var temp = arr[i];
                            arr[i] = arr[i+1];
                            arr[i+1] = temp
                      }
               }
    
          }
               console.log(arr)  // [1, 2, 3, 3, 4, 5]
    
          </script>
    </body>
    </html>

    中极版

    <!DOCTYPE html>
    <html lang="en">
    <head>
          <meta charset="UTF-8">
          <meta name="viewport" content="width=device-width, initial-scale=1.0">
          <meta http-equiv="X-UA-Compatible" content="ie=edge">
          <title>Document</title>
    </head>
    <body>
          <script>
    var arr=[5,4,3,2,1,3]
    
          for( var j = 0; j<arr.length-1; j++){ // 遍数  : length-1      
    
               for( var i = 0; i < arr.length-1-j; i++ ){ // 每回 比较  length-1 次
                      if( arr[i] > arr[i+1]){
                            
                            var temp = arr[i];
                            arr[i] = arr[i+1];
                            arr[i+1] = temp
                      }
               }
    
          }
               console.log(arr)  // [1, 2, 3, 3, 4, 5]
    
          </script>
    </body>
    </html>
  • 相关阅读:
    Unity3D 学习笔记
    Python中os和sys模块
    合并两个排序的链表
    反转链表 难
    链表中倒数第k个结点
    调整数组顺序使奇数在偶数前 14
    javascript中this详解
    静态方法实例方法
    强制类型转换
    javascript类型判断方法
  • 原文地址:https://www.cnblogs.com/javascript9527/p/11433810.html
Copyright © 2011-2022 走看看