快速排序Java实现和Javascript实现

最新推荐文章于 2024-09-14 18:52:56 发布

小贺

最新推荐文章于 2024-09-14 18:52:56 发布

阅读量282

点赞数

分类专栏： java数据结构文章标签： javascript java pivot function generator

本文链接：https://blog.csdn.net/hfj8220/article/details/7833778

版权

java数据结构专栏收录该内容

5 篇文章 0 订阅

订阅专栏

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>