Question

Need a quick solution to this in Java!

OPTION 2: RADIX SORT TESTING Write a version of Radix Sort to sort an ArrayList or array of ints / Integers that you will place in a file. The integers should all be four digits long. Run the algorithm on at least 3 different files, of different sizes (i.e., each file should have a different number of integers) and have it print the results. The minimum file size should be 20 integers. See the Radix implementation in the book to see how it works. Note that it is not a comparison sort - you don't compare two strings. It involves looking at subcomponents of the items being sorted. In the case of strings, these subcomponents are characters. Note: If you don't wish to come up with your own files of four digit integers, consider writing a separate program (which you don't have to turn in.) That program could generate four-digit integers (with padded leading Os, for example instead of writing 5, you'd write 0005. Instead of writing 12, you'd write 0012, etc.) You could use the Random class to generate the integer, and then pad it as a string before writing to file.

Answer 1

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

class A{
   public static void main(String argv[])throws Exception{
       File file = new File("a.txt");
       Vector<Integer> v = new Vector<Integer>();
       BufferedReader br = new BufferedReader(new FileReader(file));
       String st;
       while ((st = br.readLine()) != null)
           v.add(Integer.parseInt(st));
       int[] arr = new int[v.size()];
for (int i=0;i<v.size();i++)
   arr[i]=(int)v.elementAt(i);
System.out.println("\nInteger in a.txt file");
Radix.printArray(arr,arr.length);
Radix.radixSort(arr,arr.length);
System.out.println("\nRadixSort Integer in a.txt file");
Radix.printArray(arr,arr.length);
System.out.println("\n\n");
File file1 = new File("b.txt");
       Vector<Integer> v1 = new Vector<Integer>();
       BufferedReader br1 = new BufferedReader(new FileReader(file1));
       String st1;
       while ((st1 = br1.readLine()) != null)
           v1.add(Integer.parseInt(st1));
       int[] arr1 = new int[v1.size()];
for (int i=0;i<v1.size();i++)
   arr1[i]=(int)v1.elementAt(i);
System.out.println("\nInteger in b.txt file");
Radix.printArray(arr1,arr1.length);
Radix.radixSort(arr1,arr1.length);
System.out.println("\nRadixSort Integer in b.txt file");
Radix.printArray(arr1,arr1.length);
System.out.println("\n\n");
File file2 = new File("c.txt");
       Vector<Integer> v2 = new Vector<Integer>();
       BufferedReader br2 = new BufferedReader(new FileReader(file2));
       String st2;
       while ((st2 = br2.readLine()) != null)
           v2.add(Integer.parseInt(st2));
       int[] arr2 = new int[v2.size()];
for (int i=0;i<v2.size();i++)
   arr2[i]=(int)v2.elementAt(i);
System.out.println("\nInteger in c.txt file");
Radix.printArray(arr2,arr2.length);
Radix.radixSort(arr2,arr2.length);
System.out.println("\nRadixSort Integer in c.txt file");
Radix.printArray(arr2,arr2.length);
   }
}

class Radix {
   static int Max(int arr[], int n)
   {
       int mx = arr[0];
       for (int i = 1; i < n; i++)
           if (arr[i] > mx)
               mx = arr[i];
       return mx;
   }
   static void countSort(int arr[], int n, int exp)
   {
       int output[] = new int[n];
       int i;
       int count[] = new int[10];
       Arrays.fill(count,0);
       for (i = 0; i < n; i++)
           count[ (arr[i]/exp)%10 ]++;
       for (i = 1; i < 10; i++)
           count[i] += count[i - 1];
       for (i = n - 1; i >= 0; i--)
       {
           output[count[ (arr[i]/exp)%10 ] - 1] = arr[i];
           count[ (arr[i]/exp)%10 ]--;
       }
       for (i = 0; i < n; i++)
           arr[i] = output[i];
   }
   static void radixSort(int arr[], int n)
   {
       int m = Max(arr, n);
       for (int exp = 1; m/exp > 0; exp *= 10)
           countSort(arr, n, exp);
   }
   static void printArray(int arr[], int n)
   {
       for (int i=0; i<n; i++)
           System.out.print(arr[i]+" ");
   }
}

import java.io.*; import java.util.*; class A{ public static void main(String argv[]) throws Exception{ File file = new File("a.txt"); Vector<Integer> V = new Vector Integer> ; BufferedReader br = new BufferedReader(new FileReader(file)); String st; while ((st = br.readLine()) != null) v.add(Integer.parseInt(st)); int[] arr = new int[v.size(): for (int i=0;i<v.size();i++) arr[i]=(int)v.elementAt(i); System.out.println("\nInteger in a.txt file") Radix.printArray(arr, arr.length); Radix.radixSort(arr, arr.length); System.out.println("\nRadixSort Integer in a.txt file"); Radix.printArray(arr, arr.length); System.out.println("\n\n"); File file1 = new File("b.txt"); Vector<Integer> v1 = new Vector<Integer>O: BufferedReader br1 = new BufferedReader(new FileReader(file1) String st1; while ((st1 = br1.readLine()) != null) v1.add(Integer.parseInt(st1)); int[] arr1 = new int[v1.size(): for (int i=0;i<v1.size();i++) arr1[i]=(int)v1.elementat(i); System.out.println("\nInteger in b.txt file"); Radix.printArray(arr1, arr.length); Radix.radixSort(arri, arri.length); System.out.println("\nRadixSort Integer in b.txt file") Radix.printArray(arri, arri.length); System.out.println("\n\n"); File file2 = new File("c.txt"); Vector<Integer> V2 = new Vector Integer>O: BufferedReader br2 = new BufferedReader(new FileReader(file)); String st2; while ((st2 = br2.readLine() != null) v2.add(Integer.parseInt(st2)); int[] arr2 = new int[v2.size(): for (int i=0;i<v2.size(); i++) arr2[i]=(int)v2.elementAt(i); System.out.println("\nInteger in c.txt file") Radix.printArray(arr2, arr2.length);

Radix.printArray(arr2, arr2.length); Radix.radixSort(arr2, arr2.length); System.out.println("InRadix Sort Integer in c.txt file") Radix.printArray(arr2, arr2.length); class Radix { static int Max(int arr[], int n) i++) int mx = arr[0]; for (int i = 1; i < n; if (arr[i] > mx) mx = arr[i]; return mx; static void countSort(int arr[], int n, int exp) int output[] = new int[n]; int i; int count[] = new int[10]; Arrays. fil1(count,0); for (i = 0; i < n; i++) count[ (arr[i]/exp)%10 ] ++; for (i = 1; i < 10; i++) count[i] += countſi - 1]; for (i = n - 1; i >= 0; i--) { output[countſ (arr[i]/exp)%10 ] - 1] = arr[i]; countſ (arr[i]/exp)%10 ]--; : CO for (i = 0; i < n; i++) arr[i] = output[i]; T static void radixSort(int arr[], int n) int m= Max(arr, n); for (int exp = 1; m/exp > 0; exp*= 10) count Sort(arr, n, exp); static void printArray(int arr[], int n) 89 for (int i=0; i<n; i++) System.out.print(arr[i]+" ");

a.txt 10 A.java 3244 2444 2121 6444 3635 1444 7453 2424 4734 3634 2424 7565 3255 7445 2324 7464 3552 1424 0204 4643 9845 12 13 14 16 17 18 19 20 21

A.java b.txt 12 3535 6465 5766 5734 2424 8675 3535 7564 3235 6466 2344 4365 7645 6775 2352 7885 4664 2343 7556 5854 6644 8675 2343 7754 14 15 16 17 18 19 20 21 22 23 24

A.java c.txt AUNOL VOULA 16 3255 4622 5464 7346 3463 5755 7464 3324 7454 4576 2344 4765 3333 6445 3445 5455 5345 7653 4354 2344 5755 2444 2525 5455 6767 2323 8666 4664 5868 4466 26 27 28 29 30

nikhil@nikhil-PC:~/Desktop java A Integer in a.txt file 3244 2444 2121 6444 3635 1444 7453 2424 4734 3634 2424 7565 3255 7445 2324 7464 3552 1424 204 4643 9845 RadixSort Integer in a.txt file 204 1424 1444 2121 2324 2424 2424 2444 3244 3255 3552 3634 3635 4643 4734 6444 7445 7453 7464 7565 9845 Integer in b.txt file 3535 6465 5766 5734 2424 8675 3535 7564 3235 6466 2344 4365 7645 6775 2352 7885 4664 2343 7556 5854 6644 8675 2343 7754 RadixSort Integer in a.txt file 2343 2343 2344 2352 2424 3235 3535 3535 4365 4664 5734 5766 5854 6465 6466 6644 6775 7556 7564 7645 7754 7885 8675 8675 Integer in b.txt file 3255 4622 5464 7346 3463 5755 7464 3324 7454 4576 2344 4765 3333 6445 3445 5455 5345 7653 4354 2344 5755 2444 2525 5455 6767 2323 8666 4664 5868 4466 RadixSort Integer in a.txt file 2323 2344 2344 2444 2525 3255 3324 3333 3445 3463 4354 4466 4576 4622 4664 4765 5345 5455 5455 5464 5755 5755 5868 6445 6767 7346 7454 7464 7653 8666 ikhil@nikhil-PC: -/Desktop$|