Quick sort

package DataStructure.Sort;

public class Quick {

    public static void sort(Comparable[] a){
        int lo=0;
        int hi=a.length-1;
        sort(a,lo,hi);
    }

    public static void sort(Comparable[] a,int lo,int hi){
        if (lo>=hi){
            return;
        }
        int partition=partition(a,lo,hi);
        sort(a,lo,partition-1);
        sort(a,partition+1,hi);
    }

    public static int partition(Comparable[] a,int lo,int hi){
        Comparable key = a[lo];
        int left=lo;
        int right=hi+1;
        while(true){
            while(less(key,a[--right])){
                if(right==lo){
                    break;
                }
            }
            while(less(a[++left],key)){
                if(left==hi){
                    break;
                }
            }
            if(left>=right){
                break;
            }else{
                exch(a,left,right);
            }
        }
        exch(a,lo,right);
        return right;
    }

    private static boolean greater(Comparable x,Comparable y){
        return x.compareTo(y)>0;
    }
    public static boolean less(Comparable v,Comparable w){
        return v.compareTo(w)<0;
    }

    public static void exch(Comparable[] a,int i,int j){
        Comparable temp;
        temp=a[i];
        a[i]=a[j];
        a[j]=temp;
    }


}