Solution: Find K Largest Elements in an Array

Explore two efficient approaches to find the k largest elements in an array: sorting the array and extracting the first k elements, and using a max heap to insert and pop the largest elements. Understand their implementations and analyze their time and space complexity.