How do I implement the find kth largest element in Swift?

To find the kth largest element in an array in Swift, you can utilize sorting or a priority queue (min-heap) approach. Below is a simple implementation using sorting.


        func findKthLargest(_ nums: [Int], _ k: Int) -> Int {
            let sortedNums = nums.sorted()
            return sortedNums[sortedNums.count - k]
        }

        // Example usage:
        let numbers = [3, 2, 1, 5, 6, 4]
        let k = 2
        let result = findKthLargest(numbers, k)
        print(result)  // Output: 5