sortLecNotes sortsearchassigncodeex1.java sort, search for a specific student package sortsearchassigncodeex1; import java.util.Scanner; import java.io.*; // // public class Sortsearchassigncodeex1 { // public static void fillArray(Scanner inputFile, int[] arrIn){ int indx = 0; //Complete code { arrIn[indx] = inputFile.nextInt(); indx++; } } //=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=- public static void displayArray(int[] arrIn){ for(int indx=0; indxarrIn[indx2]){ temp = arrIn[indx1]; arrIn[indx1] = arrIn[indx2]; arrIn[indx2] = temp; } } // public static void main(String[]
sortLecNotes
sortsearchassigncodeex1.java
sort, search for a specific student
package sortsearchassigncodeex1;
import java.util.Scanner;
import java.io.*;
//
//
public class Sortsearchassigncodeex1 {
//
public static void fillArray(Scanner inputFile, int[] arrIn){
int indx = 0;
//Complete code
{
arrIn[indx] = inputFile.nextInt();
indx++;
}
}
//=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-
public static void displayArray(int[] arrIn){
for(int indx=0; indx<arrIn.length;indx++)
System.out.printf("student %2d sID: %5d\n",(indx+1),arrIn[indx]);
}
//=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-
public static int searchArray(int[] arrIn, int sValue){
int retValue = -1; // if the value is not found method will return -1
for(int indx=0; //Complete code
;indx++)
if(arrIn[indx] == sValue) retValue = indx;
return retValue;
}
//=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-
public static void sortArray(int[] arrIn){
int temp;
for(int indx1=0; //Complete code
;indx1++)
for(int indx2=indx1+1; indx2<arrIn.length;indx2++)
if(arrIn[indx1]>arrIn[indx2]){
temp = arrIn[indx1];
arrIn[indx1] = arrIn[indx2];
arrIn[indx2] = temp; }
}
//
public static void main(String[] args) throws IOException{
Scanner keyboard = new Scanner(System.in);
File fn = new File("student.dat");
Scanner dataIn = new Scanner(fn);
int[] sId = new int[10];
//Complete code two calls are missing
System.out.print("\nEnter Student id to search for ");
int findId = keyboard.nextInt();
System.out.printf("The index for value %d is %d\n\n",findId,searchArray(sId,findId));
sortArray(sId);
System.out.println("\n\nSorted\n");
displayArray(sId);
}
}
/*
11115
11112
11110
11119
11117
11114
11111
11118
11113
11116
*/
0000000000000000000000000000000000000
sortsearchassignex2.java
find student and gpa based on student id
package sortsearchassignex2;
import java.util.Scanner;
import java.io.*;
/**
*
* @author gq
*/
public class Sortsearchassignex2 {
//
public static void fillArray(Scanner inputFile, String[] nArrIn, int[] iArrIn, double[] gArrIn){
int indx = 0;
while(//Complete code
)
{
iArrIn[indx] = inputFile.nextInt();
gArrIn[indx] = inputFile.nextDouble();
nArrIn[indx] = inputFile.nextLine();
if(nArrIn[indx].equals("")) nArrIn[indx] = inputFile.nextLine();
indx++;
}
}
//=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-
public static void displayArray(String[] nArrIn, int[] iArrIn, double[] gArrIn){
for(int indx=0; indx<nArrIn.length; //Complete code
)
System.out.printf("%-20s %5d %5.2f \n",nArrIn[indx],iArrIn[indx],gArrIn[indx]);
}
//=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-
public static int searchArray(int[] arrIn, int sValue){
int retValue = -1; // if the value is not found method will return -1
for(int indx=0; indx<arrIn.length;indx++)
if(arrIn[indx] == sValue) retValue = indx;
return retValue;
}
//=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-
public static void sortArray(String[] nArrIn, int[] iArrIn, double[] gArrIn){
String nTemp; int iTemp; double gTemp;
for(int indx1=0; indx1<nArrIn.length-1;indx1++)
for(int indx2=indx1+1; indx2<nArrIn.length;indx2++)
if(nArrIn[indx1].compareTo(nArrIn[indx2])>0){
nTemp = nArrIn[indx1];
nArrIn[indx1] = nArrIn[indx2];
nArrIn[indx2] = nTemp;
iTemp = iArrIn[indx1];
iArrIn[indx1] = iArrIn[indx2];
iArrIn[indx2] = iTemp;
//Complete code
}
}
//
public static void main(String[] args) throws IOException {
File fn = new File("student1.dat");
Scanner dataIn = new Scanner(fn);
String[] name = new String[10];
int[] sId = new int[10];
double[] gpa = new double[10];
//Complete code two call missing
System.out.print("\nEnter Student id to search for ");
Scanner kbd = new Scanner(System.in);
int findId = kbd.nextInt();
int findIndx = searchArray(sId,findId);
System.out.printf("The student ID %d is %s whose gpa is %5.2f\n\n",findId,name[findIndx],gpa[findIndx]);
sortArray(name,sId,gpa);
System.out.println("\n\nSorted\n");
displayArray(name,sId,gpa);
}
}
/*
student1.dat
11115 2.6
Edgar Allen Poe
11112 3.2
Mark Twain
11110 2.9
F Scott Fitzgerald
11119 1.5
Dan Brown
11117 2.6
Agatha Christie
11114 4.0
Viginia Woolf
11111 2.1
Anne Rice
11118 0.8
JK Rowlings
11113 4.0
Janet Evanovich
11116 3.2
Stephen King
*/
Step by step
Solved in 4 steps with 1 images
