leetcode-215-Kth Largest Element in an Array

Error:
do not familiar the pattern of quick sort, cannot write the code.

Use the idea of quick, pivot. Which the position of pivot tell us how many number smaller than pivot, and it can inference that the num[pivot] is the kth largest number:

if(k == kth largest of pivot)
	return nums[pivot] 
if(k > kth largest of pivot)
	return quick(nums, left, pivot - 1)
else 
	return quick(nums,pivot + 1, right)