41.笔试题-排序问题

import java.util.Scanner;
public class mayi{
    
    public static void main(String[] args){
        Scanner in = new Scanner(System.in);
        while(in.hasNext()){
            int n = in.nextInt();
            int m = in.nextInt();
            int[] num = new int[n];
            for(int i = 0; i < n; i++)
                num[i] = in.nextInt();
            quickSort(num);
            for(int i = 0;i < m - 1;i++){
                System.out.print(num[i] + ",");
            }
            System.out.println(num[m - 1]);
        }
    }
    public static void quickSort(int[] Arrays) {

        if (Arrays == null || Arrays.length < 2) {
            return;
        }
        quickSort(Arrays, 0, Arrays.length - 1);
    }
    public static void quickSort(int[] Arrays, int l, int r) {
        if (l < r) {
            swap(Arrays, l + (int) (Math.random() * (r - l + 1)), r);
            int[] p = partition(Arrays, l, r);
            quickSort(Arrays, l, p[0] - 1);
            quickSort(Arrays, p[1] + 1, r);
        }
    }
    public static int[] partition(int[] Arrays, int l, int r) {
        int min = l - 1;
        int max = r;
        while (l < max) {
            if (Arrays[l] < Arrays[r]) {
                swap(Arrays, ++min, l++);
            } else if (Arrays[l] > Arrays[r]) {
                swap(Arrays, --max, l);
            } else {
                l++;
            }
        }
        swap(Arrays, max, r);
        return new int[] { min + 1, max };
    }
    public static void swap(int[] Arrays, int i, int j) {
        int tmp = Arrays[i];
        Arrays[i] = Arrays[j];
        Arrays[j] = tmp;
    }

}