您的位置:首页 > Web前端 > JavaScript

快速排序Java实现和Javascript实现

2012-08-06 08:59 477 查看
package com.test.quicksort;

public class QuickSort {

/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
QuickSort qs = new QuickSort();
int[] a = {15,6,18,20,59,9,8,10};

a=qs.quickS(a,0,a.length-1);

for(int i=0;i<a.length;i++)
{
System.out.print(a[i]+",");
}
System.out.println();
}

public int[] quickS(int[] array,int low,int high)
{
int pivot ;
if(low<high)
{
pivot= partition(array,low,high);//划分如果在条件判断前出现会有不定数组的越界错误
quickS(array,low,pivot-1);
quickS(array,pivot+1,high);
}

return array;
}
public int partition(int[] array,int low,int high)
{
int pivot = array[low];
while(low<high)
{
while(low<high && pivot<=array[high])
high--;
System.out.println("low:"+low+"high"+high);
array[low] = array[high];
while(low<high && pivot>=array[low])
low++;
System.out.println("low:"+low+"high"+high);
array[high] = array[low];
}
System.out.println("low:"+low+"high"+high);
array[low] = pivot;

for(int i=0;i<array.length;i++)
{
System.out.print(array[i]+",");
}
System.out.println();
return low;
}
}

<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">

<html>

 <head>

  <title> New Document </title>

  <meta name="Generator" content="EditPlus">

  <meta name="Author" content="">

  <meta name="Keywords" content="">

  <meta name="Description" content="">

  <script type="text/javascript">

  function print()

  {
var array =[15,6,18,20,59,9,8,10];
QuickSort(array,0,array.length-1);
for(var i = 0;i<array.length;i++)
{
document.write(array[i]+",");
}
document.write("<br>");

  }

function QuickSort(a,low,high)

{
var pivot ;
if(low<high)
{
pivot = partition(a,low,high);
QuickSort(a,low,pivot-1);
QuickSort(a,pivot+1,high);
}
return a;

}

function partition(a,low,high)

{
var pivot = a[low];
while(low<high )
{
while(low<high && pivot<=a[high])
high--;
a[low]=a[high];
while(low<high && pivot>=a[low])
low++;
a[high]=a[low];
}
a[low] = pivot;
for(var i = 0;i<a.length;i++)
{
document.write(a[i]+",");
}
document.write("<br>");
return low;

}

print();

  </script>

 </head>

 <body>

  

 </body>

</html>
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息