用Java语言实现快速排序

import java.util.Scanner;

public class QuickSort_2 {
    public static int [] quick_sort_1(int []a,int l,int r){
         if(l>=r){
             return null;
         }
         int i = l-1;
         int j = r+1;
         int x = a[l];
         while(i<j){
             do{
                 i++;
             }while(a[i]<x);
             do{
                 j--;
             }while (a[j]>x);
             if(i<j){
                 int t = 0;
                 t = a[i];
                 a[i] = a[j];
                 a[j] = t;
             }else break;
         }
         quick_sort_1(a,l,j);
         quick_sort_1(a,j+1,r);
         return a;
    }
    public static void main(String[] args) {
        QuickSort_2 quickSort = new QuickSort_2();
        Scanner scanner = new Scanner(System.in);
        int a[] = new int [5];
        for(int i=0;i<5;i++){
            a[i] = scanner.nextInt();
        }
        a =  quickSort.quick_sort_1(a,0,4);
        for(int i=0;i<5;i++){
            System.out.println(a[i]);
        }
    }
}