public class QuickSort {
public static void main(String[] args) {
int k=2;
int a[]={11,49,38,29,65,97,76,13,27,49,22,19};
if(k>0&&k<=a.length-1)
{
//sort(a,0,a.length-1);
int i = topK(a, 0, a.length - 1, k);
display(a,a.length-1);
System.out.println("====="+a);
}else{
System.out.println("Are You Kidding Me?");
}
}
public static void display(int a[],int k)
{
for(int i=0;i<=k;i++)
{
System.out.print(a[i]+",");
}
}
private static int partition(int[] a,int start,int end){
int temp=a[start];
while (start<end){
while (start<end&&a[end]<=temp)end--;
a[start]=a[end];
while (start<end&&a[start]>=temp)start++;
a[end]=a[start];
}
a[start]=temp;
return start;
}
private static void sort(int[] a ,int start ,int end){
if (start<end){
int t=partition(a,start,end);
sort(a,start,t-1);
sort(a,t+1,end);
}
}
private static int partition(int[] arr,int low,int high){
int pivot=arr[high];
int i=low-1;
int j,tmp;
for(j=low;j<high;++j)
if(arr[j]<pivot){
tmp=arr[++i];
arr[i]=arr[j];
arr[j]=tmp;
}
tmp=arr[i+1];
arr[i+1]=arr[high];
arr[high]=tmp;
return i+1;
}
private static int topK(int[] a, int start, int end, int k) {
if (start < end) {
int t = partition(a, start, end);
if (t == k) {
return t;
} else if (t < k) {
return topK(a, t + 1, end, k - t);
} else {
return topK(a, start, t - 1, k);
}
}
return 0;
}
}
TopK算法
最新推荐文章于 2024-07-25 16:00:36 发布