return heap.peek()

}

funfindKthLargestRecursive(nums:IntArray,k:Int):Int= quickSelect(

array= nums,

startIndex=0,

endIndex= nums.lastIndex,

k= k

)

privatefunquickSelect(

array:IntArray,

startIndex:Int,

endIndex:Int,

k:Int,

):Int {

@Suppress("UnnecessaryVariable")val pivotIndex= endIndex

var validIndexForPivot= startIndex

for (iin startIndex until endIndex) {

if (array[i]< array[pivotIndex]) {

val temp= array[i]

array[i]= array[validIndexForPivot]

array[validIndexForPivot]= temp

validIndexForPivot++

}

}

val temp= array[validIndexForPivot]

array[validIndexForPivot]= array[pivotIndex]

array[pivotIndex]= temp

returnif (validIndexForPivot== (array.size- k)) array[validIndexForPivot]

elseif (validIndexForPivot> array.size- k) quickSelect(array, startIndex, validIndexForPivot-1, k)

else quickSelect(array, validIndexForPivot+1, endIndex, k)

}

}