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++; }
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
Step by step
Solved in 2 steps
