Input: arr = [1, 2, 3, 4, 5, 6], n = 3; Output: 4, 5, 6 Explanation: Here we will see the 3 largest elements in the given array are 4, 5, 6. Input: arr = [5, 76, 32, 98, 52, 57] n = 2; Output: 98 , 76
Brute Force Approach: We will first make an array named largArr having the length equal to n. Then for each index of largArr, we will fill the element from the arr one by one
Example: If we have n=3 then array largArr will be having the length of equal to 3 then we will run for loop one by one to fill the element in the largArr.
98 93 91
Optimized Solution: We first sort the array in increasing order and then we run the loop for the length equal to n and print the first n largest elements.
98 93 91 [98,93,91]