Question

Write a complete JAVA program to do the following program.

The main program calls a method to read in (from an input file) a set of people's three-digit ID numbers and their donations to a charity (hint: use parallel arrays)Then the main program calls a method to sort the ID numbers into numerical order, being sure to carry along the corresponding donations. The main program then calls a method to print the sorted 1ists in tabular form, giving both ID numbers and donations Then the main program calls another method to sort the donation amounts into ascending order, carrying along the corresponding ID numbers. It the, once again, prints the sorted lists, giving both ID numbers and donations Here are the details: (a) The main program calls a method to read in the data from a file The data consists of sets of data, each of which contains a person' s three-digit ID number and an integer (e.g., 456 20000 or 123 30234) . The file is read until end-of-file is reached. The method returns how many sets of data were read in. The main program calls the return value The main program calls these arrays idnumbers and donations. A separate printing method prints the original set of data in the form of a neat table. hen the arrays print, there should be an overall heading, plus headings for the columns of ID numbers and donations (b) Then the main program sends the array of ID numbers, the array of donations, and the size donorcount to a sorting method. This method sorts the ID numbers into numerical order Be sure to maintain the match-up of ID numbers and donations. For example, 456 should always be associated with 20000, no matter where 456 moves in numerical order similarly, 123 should stay with 30234 When the sorting method finishes and returns control to the main program, the main program calls the printing method to once again print the two arrays )Next, the main program sends the same three parameters to the second sorting method, which sorts the donations into numerical order, being sure to maintain the linkup of ID numbers and donations When this sorting method finishes and returns control to the main program, the main program, once again, calls the printing method to print the two arrays with appropriate headings Your arrays should have room for up to 50 entries. To test the program, have a set of data with at least 15 to 20 values in each array Make sure that your original order in not close to numerical order for either array and that the two numerical orders are not close to each other

Answer 1

Hi,

Please find the code below.

package normalClasses;

import java.io.File;

import java.io.FileNotFoundException;

import java.util.Scanner;

public class Donor {

public static void main(String[] args){

int idNumbers[] = new int[50]; //created two array each of 50 size

int donations[] = new int[50];

int donorCount=readFile(idNumbers, donations); //calling readfile function

System.out.println("--------------------Original record--------------------");

printDetails(idNumbers,donations,donorCount); //printing details

sortByDonorId(idNumbers,donations,donorCount);

System.out.println("--------------------Sort by donor id--------------------");

printDetails(idNumbers,donations,donorCount);

sortByDonation(idNumbers,donations,donorCount);

System.out.println("--------------------Sort by donation amount--------------------");

printDetails(idNumbers,donations,donorCount);

}

private static void sortByDonation(int[] idNumbers, int[] donations, int donorCount) {

for(int i=0;i<=donorCount;i++){

for(int j=i+1;j<=donorCount;j++){

if(donations[i]>donations[j]){ //comparison based on donations

int temp = idNumbers[i];

idNumbers[i] = idNumbers[j];

idNumbers[j] = temp;

temp = donations[i];

donations[i] = donations[j];

donations[j] = temp;

}

}

}

}

private static void sortByDonorId(int[] idNumbers, int[] donations, int donorCount) {

for(int i=0;i<=donorCount;i++){

for(int j=i+1;j<=donorCount;j++){

if(idNumbers[i]>idNumbers[j]){ //comparison based on donor number

int temp = idNumbers[i];

idNumbers[i] = idNumbers[j];

idNumbers[j] = temp;

temp = donations[i];

donations[i] = donations[j];

donations[j] = temp;

}

}

}

}

public static void printDetails(int[] idNumbers, int[] donations, int donorCount){

System.out.printf("%-5s%s"," ","Donor information"); //using printf for format output

System.out.printf("\n%-20s%-20s","ID number","donations");

for(int i=0;i<=donorCount;i++){

System.out.printf("\n%-20s%-20s",idNumbers[i],donations[i]);

}

System.out.println();

}

public static int readFile(int idNumbers[],int donations[]){

File file = new File("input.txt"); //reading data from this file

Scanner reader;

int donorIndex=-1; //keep track of number of records

try {

reader = new Scanner(file);

while(reader.hasNext()){

donorIndex++;

String line = reader.nextLine();

idNumbers[donorIndex] = Integer.parseInt(line.split(" ")[0]); //spliting line by space,0 is idnumber

donations[donorIndex] = Integer.parseInt(line.split(" ")[1]); //spliting line by space,1 is donations

}

reader.close();

} catch (FileNotFoundException e) {

// TODO Auto-generated catch block

e.printStackTrace();

}

return donorIndex;

}

}

output:

console X <terminated>Donor [Java Application] C:\Program FilesJavajre7 bin\javaw.exe (Jan 18, 2018, 11:14:24 AM) Original record Donor information ID number 123 523 235 312 345 624 donations 435235 652232 821903 432555 532555 532555 92555 532555 32555 132555 223 745 900 -Sort by donor id--- Donor information donations 435235 532555 821903 432555 92555 532555 652232 532555 32555 132555 ID number 123 223 235 312 345 523 624 745 900 -Sort by donation amount-- Donor information donations 32555 92555 132555 432555 435235 532555 532555 ID number 745 900 312 123 624 223

where input.txt file is

123 435235
523 652232
235 821903
312 432555
345 532555
624 532555
333 92555
223 532555
745 32555
900 132555

Make sure input.txt file is in the same folder in which .java file is there. Otherwise it will throw exception file not found.