Javascript Program to Find k maximum elements of array in original order Last Updated : 13 Sep, 2024 Summarize Comments Improve Suggest changes Share Like Article Like Report Given an array arr[] and an integer k, we need to print k maximum elements of given array. The elements should printed in the order of the input.Note: k is always less than or equal to n.Examples: Input : arr[] = {10 50 30 60 15} k = 2 Output : 50 60 The top 2 elements are printed as per their appearance in original array. Input : arr[] = {50 8 45 12 25 40 84} k = 3 Output : 50 45 84Method 1:We search for the maximum element k times in the given array. Each time we find one maximum element, we print it and replace it with minus infinite (Number.MIN_SAFE_INTEGER in Javascript) in the array. Also, the position of all k maximum elements is marked using an array so that with the help of that array we can print the elements in the order given in the original array. The time complexity of this method is O(n*k). JavaScript // JavaScript program to find k maximum elements // of array in original order // Function to print k Maximum elements function printMax(arr, k, n) { let brr = Array(n).fill(0); let crr = Array(n) // Copying the array arr // into crr so that it // can be used later for (let i = 0; i < n; i++) { crr[i] = arr[i]; } // Iterating for K-times for (let i = 0; i < k; i++) { // Finding the maximum element // along with its index let maxi = Number.MIN_SAFE_INTEGER; let index; for (let j = 0; j < n; j++) { if (maxi < arr[j]) { maxi = arr[j]; index = j; } } // Assigning 1 in order // to mark the position // of all k maximum numbers brr[index] = 1; arr[index] = Number.MIN_SAFE_INTEGER; } for (let i = 0; i < n; i++) { // Printing the k maximum // elements array if (brr[i] == 1) console.log(crr[i] + " "); } } // Driver code let arr = [50, 8, 45, 12, 25, 40, 84]; let n = arr.length; let k = 3; printMax(arr, k, n); // This code is contributed by Pushpesh raj Output50 45 84 Complexity Analysis:Time Complexity: O(n*k)Auxiliary Space: O(n)Method 2: In this method, we store the original array in a new array and will sort the new array in descending order. After sorting, we iterate the original array from 0 to n and print all those elements that appear in first k elements of new array. For searching, we can do Binary Search. JavaScript // JavaScript program to find k maximum elements // of array in original order // Function to print m Maximum elements function printMax(arr, k, n) { // vector to store the copy of the // original array let brr = arr.slice(); // Sorting the vector in descending // order. Please refer below link for // details // https://www.geeksforgeeks.org/sort-c-stl/ brr.sort((a, b) => b - a); // Traversing through original array and // printing all those elements that are // in first k of sorted vector. // Please refer https://goo.gl/44Rwgt // for details of binary_search() for (let i = 0; i < n; ++i) if (brr.indexOf(arr[i]) < k) console.log(arr[i] + " "); } // Driver code let arr = [50, 8, 45, 12, 25, 40, 84]; let n = arr.length; let k = 3; printMax(arr, k, n); // This code is contributed by ShubhamSingh10 Output50 45 84 Complexity Analysis:Time Complexity: O(n Log n) for sorting. Auxiliary Space: O(n)Please refer complete article on Find k maximum elements of array in original order for more details! Comment More infoAdvertise with us Next Article JavaScript Program to Find kth Largest/Smallest Element in an Array K kartik Follow Improve Article Tags : JavaScript Binary Search STL cpp-vector Practice Tags : Binary SearchSTL Similar Reads Find k maximum elements of array in original order Given an array arr[] and an integer k, we need to print k maximum elements of given array. The elements should printed in the order of the input.Note : k is always less than or equal to n. Examples: Input : arr[] = {10 50 30 60 15} k = 2 Output : 50 60 The top 2 elements are printed as per their app 11 min read JavaScript Program to Find kth Largest/Smallest Element in an Array JavaScript allows us to find kth largest/smallest element in an array. We are given an array containing some elements, we have to find kth smallest/largest element from the array where k is a number greater than zero and less than equal to the total number of elements present in the array. There are 5 min read Maximum element in a sorted and rotated array Given a sorted array arr[] (may contain duplicates) of size n that is rotated at some unknown point, the task is to find the maximum element in it. Examples: Input: arr[] = {5, 6, 1, 2, 3, 4}Output: 6Explanation: 6 is the maximum element present in the array.Input: arr[] = {3, 2, 2, 2}Output: 3Expla 7 min read Minimize maximum array element possible by at most K splits on the given array Given an array arr[] consisting of N positive integers and a positive integer K, the task is to minimize the maximum element present in the array by splitting at most K array elements into two numbers equal to their value. Examples: Input: arr[] = {2, 4, 8, 2}, K = 4Output: 2Explanation:Following se 9 min read Largest element after K operations on Array Given array A[] (1 <= A[i] <= 108) of size N (2 <= N <= 103) and integer K (1 <= K <= 108), the task is to find the largest element of the array after performing the given operation at most K times, in one operation choose i from 1 to N - 1 such that A[i] <= A[i + 1] and then in 13 min read Maximize the minimum value of Array by performing given operations at most K times Given array A[] of size N and integer K, the task for this problem is to maximize the minimum value of the array by performing given operations at most K times. In one operation choose any index and increase that array element by 1. Examples: Input: A[] = {3, 1, 2, 4, 6, 2, 5}, K = 8Output: 4Explana 10 min read Like