Write a method called kthLargest() that accepts an integer x and an array a of integers as its parameters.   It should then return the elements that that k elements of greater or equal value.   So if k = 0 return the largest element.  If k = 1. return the second-largest element, and so on.  Do not change the array itself, but you can make a copy if you want. Suggested approach make a COPY of the array. Sort the copy then find the kth element of the copy and return it. The original is left untouched!  :)  For example if array1 = {74, 85, 102, 99, 101, 56, 84} and the function kthLargest(2, array1)  is called, then your method should return 99 because there are two values that are larger than 99.   (101 and 102).       If x is less than zero or greater than/equal to the the size of the array then return -9999;   Make sure your main function works for the following public static void main(String[] args) { int[] array1 = {6, 8, 2, 3, 5, 12, 16, 1, 7, 4, 21, 19}; int answer = kthLargest(0,array1); System.out.println(answer); answer = kthLargest(1,array1); System.out.println(answer); answer = kthLargest(2,array1); System.out.println(answer); answer = kthLargest(10,array1); System.out.println(answer); answer = kthLargest(11,array1); System.out.println(answer); answer = kthLargest(-1,array1); System.out.println(answer); answer = kthLargest(20,array1); System.out.println(answer); }

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

Write a method called kthLargest() that accepts an integer x and an array a of integers as its parameters.   It should then return the elements that that k elements of greater or equal value.   So if k = 0 return the largest element.  If k = 1. return the second-largest element, and so on.  Do not change the array itself, but you can make a copy if you want.

  • Suggested approach
    • make a COPY of the array.
    • Sort the copy
    • then find the kth element of the copy and return it.
      • The original is left untouched!  :) 

For example if array1 = {74, 85, 102, 99, 101, 56, 84} and the function kthLargest(2, array1)  is called, then your method should return 99 because there are two values that are larger than 99.   (101 and 102).    

 

If x is less than zero or greater than/equal to the the size of the array then return -9999;

 

Make sure your main function works for the following

public static void main(String[] args)
{
int[] array1 = {6, 8, 2, 3, 5, 12, 16, 1, 7, 4, 21, 19};
int answer = kthLargest(0,array1);
System.out.println(answer);
answer = kthLargest(1,array1);
System.out.println(answer);
answer = kthLargest(2,array1);
System.out.println(answer);
answer = kthLargest(10,array1);
System.out.println(answer);
answer = kthLargest(11,array1);
System.out.println(answer);
answer = kthLargest(-1,array1);
System.out.println(answer);
answer = kthLargest(20,array1);
System.out.println(answer);
}
 
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 1 images

Blurred answer
Knowledge Booster
Arrays
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education