#####   ######  #####    ###    #   #  ###  #   #  ######
##  ##  ##      ##  ##  ## ##   #   #   #   #   #  ##
#####   ####    #####   #   #   #   #   #   #   #  ####
##  #   ##      ##      ## ##    # #    #    # #   ##
##   #  ######  ##       ###      #    ###    #    ######

$ curl repovive.com/roadmaps/fundamental-algorithms/sorting-algorithms/kth-largest-element-implementation

░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░█████████████████████████████████████████████████████████████████████████████████████████████████████████

#####   ######  #####    ###    #   #  ###  #   #  ######
##  ##  ##      ##  ##  ## ##   #   #   #   #   #  ##
#####   ####    #####   #   #   #   #   #   #   #  ####
##  #   ##      ##      ## ##    # #    #    # #   ##
##   #  ######  ##       ###      #    ###    #    ######

$ curl repovive.com/roadmaps/fundamental-algorithms/sorting-algorithms/kth-largest-element-implementation

Repovive

Kth Largest Element - Implementation - Sorting Algorithms | Fundamental Algorithms | Repovive

Repovive.

Fundamental Algorithms8 sections · 294 units2h total

Open in Course

Kth Largest Element - Implementation

Here is the implementation using QuickSelect:

function findKthLargest(nums, k):
    target = nums.length - k
    return quickSelect(nums, 0, nums.length - 1, target)

function quickSelect(nums, left, right, target):
    pivotIdx = partition(nums, left, right)

    if pivotIdx == target:
        return nums[pivotIdx]
    else if pivotIdx < target:
        return quickSelect(nums, pivotIdx + 1, right, target)
    else:
        return quickSelect(nums, left, pivotIdx - 1, target)

Average $O(n)$ time, worst case $O(n^2)$ . Use random pivot to avoid worst case. Space is $O(1)$ (excluding input) with tail recursion.