
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN: 9780133594140
Author: James Kurose, Keith Ross
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question
![Please try the given solution whose time complexity is O(n).
Write a Java program to find the average salary of employees excluding the minimum and maximum salary.
Assume an array of unique integers `salary` where `salary[i]` is the salary of the ith employee.](https://content.bartleby.com/qna-images/question/50ca43b9-759c-47d6-b9d4-6d995da79ed3/15d81821-f1dd-42ad-ba72-10c5f3b77693/n1vszg_thumbnail.jpeg)
Transcribed Image Text:Please try the given solution whose time complexity is O(n).
Write a Java program to find the average salary of employees excluding the minimum and maximum salary.
Assume an array of unique integers `salary` where `salary[i]` is the salary of the ith employee.
Expert Solution

arrow_forward
Step 1
class Solution {
public double average(int[] salary) {
final int N = salary.length;
int min=salary[0],max=salary[0];
double sum = salary[0];
for (int i = 1; i < N; i++) {
if (salary[i]<min) min=salary[i];
if (salary[i]>max) max=salary[i];
sum += salary[i];
}
sum = sum - max - min;
return sum / (N - 2);
}
}
public class Main
{
public static void main(String args[])
{
int [] salary = {4000,3000,1000,2000};
Solution s =new Solution();
System.out.println(s.average(salary));
}
}
Step by stepSolved in 3 steps with 1 images

Knowledge Booster
Similar questions
- Using a Java program solve the following problem using arrays: Past A: Coupon collector is a classic statistic problem with many practical applications. The problem is to pick objects from a set of objects repeatedly and determine how many picks are needed for all the objects to be picked at least once. A variation of the problem is to pick cards from a shuffled deck of 52 cards repeatedly and find out how many picks are needed before you see one of each suit. Assume a picked card is placed back in the deck before picking another. Write a program to simulate the number of picks needed to get total of four cards from each different suit and display the four cards picked (it is possible that a card may be picked twice). Here is a sample run of the program: Queen of Spades 5 of Clubs Queen of Hearts 4 of Diamonds Number of picks: 12 Sample run explanation: As you see in the above run, 12 picks are made to get the four cards from different suits. The other 8 picks (12-4-8) were from the…arrow_forwardIs a self-transition mandatory in every State Diagram? Provide evidence to support your response!arrow_forwardSolution in Java Create a function that takes an array of increasing letters and return the missing letter. Examples missing Letter (["a", "b", "c", "e", "f", "g"]) → "d" missing Letter (["O", "Q", "R", "S"]) → "P"arrow_forward
- Input a list of employee names and salaries and store them in parallel arrays. End the input with a sentinel value. The salaries should be floating point numbers Salaries should be input in even hundreds. For example, a salary of 36,510 should be input as 36.5 and a salary of 69,030 should be entered as 69.0. Find the average of all the salaries of the employees. Then find the names and salaries of any employee who's salary is within 5,000 of the average. So if the average is 30,000 and an employee earns 33,000, his/her name would be found. Display the following using proper labels. i need to do this in raptor.arrow_forward7.Code for----- an array of meeting time intervals consisting ofstart and end times [[s1,e1],[s2,e2],...] (si < ei),determine if a person could attend all meetings. For example,Given [[0, 30],[5, 10],[15, 20]],return false.""".arrow_forward
arrow_back_ios
arrow_forward_ios
Recommended textbooks for you
- Computer Networking: A Top-Down Approach (7th Edi...Computer EngineeringISBN:9780133594140Author:James Kurose, Keith RossPublisher:PEARSONComputer Organization and Design MIPS Edition, Fi...Computer EngineeringISBN:9780124077263Author:David A. Patterson, John L. HennessyPublisher:Elsevier ScienceNetwork+ Guide to Networks (MindTap Course List)Computer EngineeringISBN:9781337569330Author:Jill West, Tamara Dean, Jean AndrewsPublisher:Cengage Learning
- Concepts of Database ManagementComputer EngineeringISBN:9781337093422Author:Joy L. Starks, Philip J. Pratt, Mary Z. LastPublisher:Cengage LearningPrelude to ProgrammingComputer EngineeringISBN:9780133750423Author:VENIT, StewartPublisher:Pearson EducationSc Business Data Communications and Networking, T...Computer EngineeringISBN:9781119368830Author:FITZGERALDPublisher:WILEY

Computer Networking: A Top-Down Approach (7th Edi...
Computer Engineering
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:PEARSON

Computer Organization and Design MIPS Edition, Fi...
Computer Engineering
ISBN:9780124077263
Author:David A. Patterson, John L. Hennessy
Publisher:Elsevier Science

Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:9781337569330
Author:Jill West, Tamara Dean, Jean Andrews
Publisher:Cengage Learning

Concepts of Database Management
Computer Engineering
ISBN:9781337093422
Author:Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:Cengage Learning

Prelude to Programming
Computer Engineering
ISBN:9780133750423
Author:VENIT, Stewart
Publisher:Pearson Education

Sc Business Data Communications and Networking, T...
Computer Engineering
ISBN:9781119368830
Author:FITZGERALD
Publisher:WILEY