zoukankan      html  css  js  c++  java
  • 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);
    			/*selectionSort*/
    		    alert(selectionSort(array_1));
    
    		}
    	); 
    
    
    
    </script>
    
    <style type="text/css">
    	
    	* { padding:0; margin:0; }
    
    	body {
    		padding: 100px;
    		font-size: 15px; 
    	}
    
    	
    
    
    </style>
    
    
    <script type="text/javascript">
    	function selectionSort(array){
    		var len = array.length;
    		var index = 0;
    		var k;
    		var item;
    		var c;
    		for(var i=0; i<len; i++){
    			
    			//最小的数
    			item = array[i];
    			//最小的数的位置编号
    			index = i;
    			//寻找最小的数位置
    			for(j=i+1; j<len;j++){
    				if(array[j] < item){
    					index = j;
    					item = array[j];
    				}
    			}
    			if(index != i){
    				c = array[i];
    				array[i] = array[index];
    				array[index] = c;
    			}
    		}
    		return array;
    	}
    
    
    </script>
    
    
    </head>
    
    
    
    
    <body>
    	<div>选择排序</div>
    </body>
    </html>
    
  • 相关阅读:
    第三次冲刺
    第二次冲刺
    第一次冲刺
    团队学习
    git and github
    还不够格的程序员
    CF1602F. Difficult Mountain
    线性基
    欧拉回路学习笔记
    莫比乌斯反演-学习笔记
  • 原文地址:https://www.cnblogs.com/tonglin0325/p/5179423.html
Copyright © 2011-2022 走看看