Question

-----xxxxx-------Could you please use java language. thank you. :::::: XXXX:::::::::::

Implement a recursive reverse sorting algorithm. The following requirements should meet:

a The program shall graphically prompt the user for a file.

bThe program shall read the selected file which will contain 1 integer per line.

c. The program shall sort the values it reads from the file from largest to smallest.

d.The program shall write the values to an output file from largest to smallest in the same directory as the input file.

eThe program shall write 1 integer per line in the output file.

f.The program shall use a recursive algorithm to sort the values

​This assignment should be based on:

i) Functionality - Does the program meet the requirements?

ii) Style - Do you have comments and well-written code?

iii) Design - Were good design principles used in the construction of the program?

iv) Additional Elements - Error handling, unit tests, input checking, etc.

Answer 1

import java.util.*;
import java.lang.*;
import java.io.*;

class Rextester
{
    //main method
    public static void main(String args[]) throws Exception
    {
   //creating a array
        int arr[] = new int[100];
   //scanning the input file using scanner

      System.out.print("enter the filename:\t");

      String filename;

      filename = sc.nextLine();
       Scanner sc = new Scanner(new File(filename));
   int i = 0;
   //scanning the file integer by integer
   while(sc.hasNextInt())
   {
       arr[i++] = sc.nextInt();
   }
   //sorting the array from largest to smallest
        bubbleSort(arr,arr.length);
   //writing into the output file
        PrintStream ps = new PrintStream("output.txt");
        for(i = 0;i < arr.length;i++)
       {
          ps.println(new Integer(arr[i]).toString());
       }
      
    }
   //method to sort the values from largest to small
    static void bubbleSort(int arr[], int n)
    {
        if (n == 1)
            return;
        for (int i=0; i<n-1; i++)
            if (arr[i] < arr[i+1])
            {
                // swap arr[i], arr[i+1]
                int temp = arr[i];
                arr[i] = arr[i+1];
                arr[i+1] = temp;
            }
    
        bubbleSort(arr, n-1);
    }
}

if you have any doubts please comment and please don't dislike.