javascriptの泡の並べ替え法を挿入して並べ替え法を選択して並べ替え法を並べ替えます.

3923 ワード

<!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>sort</title>
<script type="text/javascript">
var arr=new Array();
//       
for(var i=0;i<10;i++){
 arr.push(parseInt(Math.random()*100));
}
document.writeln(arr);

 /**
 *      
 * @param arr   
 * @return       
 */
var BubbleSort=function(arr){
 var arrLen=arr.length;
 for(var i=0;i<arrLen;i++){
  for(var j=arrLen-1;j>i;j--){
   if(arr[j]<arr[j-1]){
    temp=arr[j];
    arr[j]=arr[j-1];
    arr[j-1]=temp;
   }
  }
 }
 return arr;
}

 /**
 *      
 * @param arr   
 * @return       
 */
var InsertSort=function(arr){
 var arrLen=arr.length;
  　for(var i=1;i<arrLen;i++){
  temp = arr[i];
  for(var j=i ; j>0 && temp < arr[j-1] ; j--){
   　　arr[j]=arr[j-1];
   } 　
  arr[j]=temp; 　　
 } 
 return arr;
}

 /**
 *      
 * @param arr   
 * @return       
 */
var SelectSort=function(arr){
 var arrLen=arr.length;
 for(var i=0;i<arrLen;i++){
  var minIndex = i; 
  for(var j=i;j<arrLen;j++){
   if(arr[minIndex]>arr[j]) {
    minIndex=j;
    key = arr[i];
    arr[i] = arr[minIndex];
    arr[minIndex] = key; 
   }
  }
 }
 return arr;
}

 /**
 *        
 * @param arr   
 * @return      
 */
var Merge=function(left, right) {  
 var re = [];  
 while(left.length > 0 && right.length > 0) {  
  if(left[0] < right[0]) {  
   re.push(left.shift());  
  } else {  
   re.push(right.shift());  
  }  
 }  
return re.concat(left).concat(right);  
} 
 /**
 *      
 * @param arr   
 * @return       
 */
var MergeSort=function(arr){
 if(arr.length == 1) return arr;  
 var arrLen=arr.length;
 var m = Math.floor(arr.length / 2);  
 var left = arr.slice(0, m);  
 var right = arr.slice(m);  
 return Merge(MergeSort(left), MergeSort(right));  
}

 /**
 *     
 * @param arr   
 * @return       
 */
   var HeapSort=function(items)
   {
   items = array2heap(items); //       
   for(var i = items.length - 1; i >= 0; i--)
   {
      items = swap(items, 0, i); //     i     (           )
      items = moveDown(items, 0, i - 1); //           
   }
   return items;
   }
   /**
 *        
 * @param arr   
 * @return  
 */
   var array2heap=function(items)
   {
   for(var i = Math.ceil(items.length / 2) - 1; i >= 0; i--)
   {
      items = moveDown(items, i, items.length - 1); //      
   }
   return items;
   }
   /**
 *     
 * @param items   
 * @param first      
 * @param last       
 * @return  
 */
   var moveDown=function(items, first, last)
   {
   var largest = 2 * first + 1;
   while(largest <= last)
   {
      if(largest < last && items[largest] < items[largest + 1])
      {
             largest++;
      }
      if(items[first] < items[largest])
      {
             items = swap(items, first, largest); //     
             first = largest;   //   
             largest = 2 * first + 1;
      }
      else
      {
             largest = last + 1; //    
      }
   }
   return items;
   }
   /**
 *     
 * @param items   
 * @param index1   1
 * @param index2   2
 * @return         
 */
   var swap=function(items, index1, index2)
   {
   var tmp = items[index1];
   items[index1] = items[index2];
   items[index2] = tmp;
   return items;
   }

var arr =HeapSort(arr);
document.writeln("<br>");
document.writeln(arr);
</script>
</head>

<body>
</body>
</html>

並べ替えアルゴリズムの紹介と使用シーン:
http://blog.csdn.net/myjava_024/articale/detail/3232320319
http://en.wikipedia.org/wiki/Sorting_algorithm〓〓〓Merge uソフト

JS配列の長さ問題