Question: I must design code to return an unordered set of integers in ascending and descending order in Java. I just started to code in Java
I must design code to return an unordered set of integers in ascending and descending order in Java.
I just started to code in Java using Eclipse. I am brand new to coding and need help trouble shooting my code. I must sort a set of integers in ascending and then descending order. Eclipse keeps giving me an error message saying "fw is never closed". What does this mean and how do I close fw?
Thanks in advance for any help.
package square;
import java.io.*;
public class Integers
{
public static void main(String[] args) throws IOException {
int[] setOfInts = {28,3,53,4,89};
int i, j, temp;
FileWriter fw;
fw = new FileWriter("sort_log.txt");
System.out.println("Sort a set of Ints");
fw.write("Unsorted set of ints ");
for (i=0; i { fw.write(setOfInts[i] + " "); } fw.write(' '); for (j=0; j { for (i=0; i { if (setOfInts[i] > setOfInts[i+1]) { temp = setOfInts[i]; setOfInts[i] = setOfInts[i+1]; setOfInts[i+1] = temp; } } } fw.write("Sorted set of ints "); for (i=0; i { fw.write(setOfInts[i] + " "); } fw.close(); } }
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
