Academic Integrity: tutoring, explanations, and feedback — we don’t complete graded work or submit on a student’s behalf.

import java.util.*; import java.text.*; import java.io.*; public class sortnums

ID: 3625572 • Letter: I

Question

import java.util.*;
import java.text.*;
import java.io.*;

public class sortnums
{
public static void main(String []args) throws Exception
{ int[] A = new int[15];
Scanner inFile = new Scanner (new File("sortin.txt"));
PrintWriter outFile = new PrintWriter("sortout.txt");
int [] s = new int[15];
int n = input(A,inFile);
for(int i = 0; i < s.length;i++)
s[i] = i;
int left = leftover(inFile);
//outpage1(A,n,left);
sort(A,s,n);
// outpage2(A,s,n);
outFile.close();
}
public static int leftover(Scanner inFile)
{ int left = 0;
while(inFile.hasNext());
{ inFile.nextInt();
left++; }
return left;
}
public static int input(int[]A, Scanner inFile)
{ int i = 0;
while(i < A.length && inFile.hasNext())
{ A[i] = inFile.nextInt();
i++; }
return i;
}
public static void sort(int[]A, int[]s, int n)
{ int k, i, minI, temp;
for(k = 0; k < n - 1; i = k + 1)
{ minI = k;
for(i = k + 1; i < n; i++)
{ if(A[i] < A[minI])
{ minI = i;
temp = A[minI];
A[minI] = A[k];
A[k] = temp;
temp = s[minI];
s[minI] = s[k];
s[k] = temp; }
}
}
}
}

Explanation / Answer

check the value of n in subroutine sort