Question

Course: CMSC 200 (Computer Programming - Java)

CMSC200 HOMEWORK 9 Graded against 3 test cases totaling 30 points Description: Suppose the weekly hours for all employees are stored in a two-dimensional array. Each row records an employee's seven-day work hours with seven columns. For example, the following array stores the work hours for eight employees. Write a program that displays employees and their total hours in decreasing order of the total hours. See sample output below Required Method public static void sort (int[][] workHours) None. All testing is done through the required method which accepts a populated 2-dim INTEGER array. Note: In the example below, only the numeric values would be contained in the array Input Output Employee and total hours in decreasing order EXAMPLE When passing in the follow array, the output is display below Array: Su Mon Tue Wen Thurs Fr Sat Employee024 Employee 73 Employee 233 Employee 3 93 Employee 4 35 Employee 534 Employee 637 Employee7 63 4 4 4 3 41 4 Output Employee 7: 41 Employee 6: 37 Employee 0: 34 Employee 4: 32 Employee 3: 31 Employee 1: 28 Employee 5: 28 Employee 2: 20 Packaging: Fully qualified class names are listed below: (Note: the bold is the class itself) edu.ben.homeworks.homework9.Homework Submission: Submit your code, as always, to both SVN and WebCAT. Benedictine University

Answer 1

/*
	Suppose the weekly hours for all employees are stored in a two-dimensional array.
	Each row records an employ-ee’s seven-day work hours with seven columns.
	For example, the following array stores the work hours for eight employees.
	Write a program that displays employees and their total hours in decreasing
	order of the total hours
	*/
	public class Exercise_08_03 {
	public static void main(String[] args) {
	int[][] employeeHours =
	{{2 ,4, 3, 4, 5, 8, 8},
	{7, 3, 4, 3, 3, 4, 4},
	{3, 3, 4, 3, 3, 2, 2},
	{9, 3, 4, 7, 3, 4, 1},
	{3, 5, 4, 3, 6, 3, 8},
	{3, 4, 4, 6, 3, 4, 4},
	{3, 7, 4, 8, 3, 8, 4},
	{6, 3, 5, 9, 2, 7, 9}};
	//int[][] totalHoursPerEmployee = new int[7][1];
	int[] totalHoursPerEmployee = sumEmployeeHours(employeeHours);
	int[] indexList = new int[totalHoursPerEmployee.length];
	sortWhileKeepingIndices(totalHoursPerEmployee, indexList);
	for (int i = 0; i < totalHoursPerEmployee.length; i++) {
	System.out.printf("Employee %s worked %d hours%n", indexList[i], totalHoursPerEmployee[i]);
	}
	System.out.println(java.util.Arrays.toString(indexList));
	}
	public static int[] sumEmployeeHours(int[][] hours) {
	int[] totalHoursPerEmployee = new int[hours.length];
	for (int i = 0; i < hours.length; i++) {
	int sum = 0;
	for (int j = 0; j < hours[i].length; j++) {
	sum += hours[i][j];
	}
	totalHoursPerEmployee[i] = sum;
	}
	return totalHoursPerEmployee;
	}
	static void sortWhileKeepingIndices(int[] totalHours, int[] indexList) {
	//fill indexList
	for (int i = 0; i < indexList.length; i++) {
	indexList[i] = i;
	}
	for (int i = 0; i < totalHours.length; i++) {
	int currentMax = totalHours[i];
	int currentMaxIndex = i;
	for (int j = i + 1; j < totalHours.length; j++) {
	if (currentMax < totalHours[j]) {
	currentMax = totalHours[j];
	currentMaxIndex = j;
	}
	}
	if (currentMaxIndex != i) {
	totalHours[currentMaxIndex] = totalHours[i];
	totalHours[i] = currentMax;
	int temp = indexList[currentMaxIndex];
	indexList[currentMaxIndex] = indexList[i];
	indexList[i] = temp;
	}
	System.out.println(java.util.Arrays.toString(indexList) + " - " + java.util.Arrays.toString(totalHours));
	}
	}
	}