15. Kth Largest Element in an Array

class Solution {
    public int findKthLargest(int[] nums, int k) {
        k = nums.length - k;
        int lo = 0;
        int hi = nums.length - 1;
        while( lo < hi ){
            int j = partition(nums, lo, hi);
            if( j < k )lo = j + 1;
            else if( j > k )hi = j - 1;
            else break;
        }
        return nums[k];
    }
    private int partition(int[] a, int lo, int hi){
        int i = lo;
        int j = hi + 1;
        while(true){
            while( i < hi && less(a[++i], a[lo]));
            while( j > lo && less(a[lo], a[--j]));
            if( i >= j )break;  
            exch(a, i, j);
        }
        exch(a, lo, j);
        return j;
    }
    private void exch(int[] a, int i, int j){
        int temp = a[i];
        a[i] = a[j];
        a[j] = temp;
    }
    private boolean less(int c, int d){
        return c < d;
    }
}