Contact Us

Polynomial.java

//Boyd, Timmothy

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

public class Polynomial
{
    private int[] coefficients;

public Polynomial(int[] coefficients)
    {
        this.coefficients = coefficients;
    }
    public static Polynomial input(BufferedReader file) throws IOException
    {
        //PROVIDED BY INSTRUCTOR
        
        int coefficient, exponent, maxExponent;
        int[] coefficients;
        String text = file.readLine();
        if (text == null)
            return null;
        StringTokenizer tokenizer = new StringTokenizer(text);
        coefficient = Integer.parseInt(tokenizer.nextToken());
        maxExponent = Integer.parseInt(tokenizer.nextToken());
        coefficients = new int[maxExponent + 1];
        for (exponent = 0; exponent <= maxExponent; exponent++)
            coefficients[exponent] = 0;
        coefficients[maxExponent] = coefficient;
        
            do{
            coefficient = Integer.parseInt(tokenizer.nextToken());
            exponent = Integer.parseInt(tokenizer.nextToken());
            coefficients[exponent] = coefficient;
            }while(tokenizer.hasMoreTokens() == true);
        
        Polynomial polynomial = new Polynomial(coefficients);
        return polynomial;

}

//TO STRING METHOD
   
        public String toString(){
            String Poly = "";
            for(int x=coefficients.length-1; x>=0; x--){
            //CONVERTS THE POLYNOMIAL OBJECT INTO A STRING TO BE OUTPUT TO THE SCREEN AND INTO THE NEW TEXT FILE
            Poly += (String.valueOf(coefficients[x]) + "x^" + String.valueOf(x) );
            //ADDS A + SIGN TO THE EQUATION IF IT IS NOT THE LAST NUMBER IN THE POLYNOMIAL
            if (x!=0){
                Poly += ("+");
            }
            
            }
            //RETURNS A STRING IN THE FORMAT 8x^3+4x^2+2x+1
            return Poly;
    }
        
        
        
        
        
        //COMPARETO METHOD
        
        public boolean compareTo(Polynomial other){
        
        //BOOLEAN FOR USE COMPARE POLYNOMIALS
        boolean inorder = false;
        int x=this.coefficients.length-1;
        int y=other.coefficients.length-1;
        //THIS CHECKS TO SEE ONE HAS A HIGHER EXPONENT OR NOT
        if (x>y){
        inorder = true;
        }
        
        if(x<y){
        inorder = false;}
        
        
        //IF EXPONENTS ARE TO SAME DEGREE, THIS CHECKS OUT THE COEFFICIENTS
        if (x==y){
            boolean looking = true;
            int i=0;
            while (looking){
                if(this.coefficients[i] > other.coefficients[i]){
                looking = false;
                inorder = true;}
                
                if(this.coefficients[i] < other.coefficients[i]){
                looking=false;
                inorder = false;} 
                
                i++;
            }
            
            
        }
        
return inorder;

}
    
}

Project1.java Main( ) //Boyd, Timmothy package Project_1; import java.lang.*; import java.io.*; import java.util.*; public class Project1 { public static void main(String[] args) { Scanner input = new Scanner(System.in); System.out.println( "Please enter the first file name:"); String fileName1 = input.nextLine(); //CHECKS TO SEE IF FILES ARE SORTED, IF NOT PROGRAM TERMINATES if(checkSorted(fileName1) == false){ System.out.println("TERMINATING, FILE NOT SORTED"); FileUnsorted.Error(); } System.out.println( "Please enter the second file name:"); String fileName2 = input.nextLine(); if(checkSorted(fileName2) == false){ System.out.println("TERMINATING, FILE NOT SORTED"); FileUnsorted.Error(); } //MERGE OPERATION try { //PREPARES A NEW FILE TO HOLD MERGED FILES File file2 = null; file2 = new File ("Sorted.txt"); FileWriter file_writer = new FileWriter (file2); BufferedWriter buf_writer = new BufferedWriter (file_writer); PrintWriter print_writer = new PrintWriter (buf_writer,true); //THIS IS THE FIRST SORTED FILE File file_1 = new File(fileName1); FileReader reader1 = new FileReader(file_1); BufferedReader in1 = new BufferedReader(reader1); //HERE IS THE SECOND SORTED FILE File file_2 = new File(fileName2); FileReader reader2 = new FileReader(file_2); BufferedReader in2 = new BufferedReader(reader2); //THIS CREATES TWO POLYNOMIAL OBJECTS Polynomial Poly1 = Polynomial.input(in1); Polynomial Poly2 = Polynomial.input(in2); //WHILE THERE IS ANOTHER COMPARISSON TO MAKE while((Polynomial.input(in1) != null) && (Polynomial.input(in2) != null) ){ //THIS WILL WRITE THE FIRST POLY TO THE NEW TEXT FILE IF IT IS THE LARGER OF THE TWO if(Poly1.compareTo(Poly2)){ print_writer.println (Poly1.toString()); //PRINTS THE OUTPUT TO THE SCREEN AS WELL AS THE NEW TEXT FILE System.out.println(Poly1.toString()); //THEN GET A NEW POLYNOMIAL FOR THE TEXT FILE Poly1 = Polynomial.input(in1); } else{ //IF THE SECOND TEXT FILE'S POLYNOMIAL IS THE BIGGEST OF THE TWO print_writer.println (Poly2.toString()); //PRINTS THE OUTPUT TO THE SCREEN AS WELL AS THE NEW TEXT FILE System.out.println(Poly2.toString()); //THEN GET A NEW POLYNOMIAL FOR THE TEXT FILE Poly2 = Polynomial.input(in2); } if (print_writer.checkError ()) { System.out.println ("An output error occurred!" ); } } }catch (IOException e) { e.printStackTrace(); } } //CHECK SORTED METHOD USED TO CHECK AND MAKE SURE BOTH FILES ARE SORTED public static boolean checkSorted(String fileName){ try { File file = new File(fileName); FileReader reader = new FileReader(file); BufferedReader in = new BufferedReader(reader); Polynomial current = Polynomial.input(in); Polynomial previous = Polynomial.input(in); boolean compares = true; //WHILE THE FILE IS NOT AT IT'S END, AND WHILE THE FILE IS STILL IN ORDER while((Polynomial.input(in)) != null){ while(compares){ current = previous; previous = Polynomial.input(in); compares = current.compareTo(previous); } //IF THE FILE IS NOT IN ORDER, RETURN FALSE if (compares == false){ return false; } } //CLOSE THE FILE in.close(); } catch (IOException e) { e.printStackTrace(); } //THE FILE LOOKS GOOD, SO TRUE IS RETURNED return true; } }

FileUnsorted.java//Boyd, Timmothy package Project_1; public class FileUnsorted { public static void Error() { //EXITS IN CASE OF A FILE UNSORTED ERROR System.exit(0); } }