package edu.grinnell.csc207.zhangshe.hw2;

public class TwoC {
	  
	  /**
	   * Compare two rational numbers, return the greater one. (Observer)
	   */
	  
	  public Rational compare (Rational num1, Rational num2)
	  {
		  return null; // STUB
	  } // compare (Rational num1, Rational num2)
	  
	  
	  /** 
	   * Increment the given rational number. (Mutator)
	   * 
	   */
	  public Rational increment (Rational num)
	  {
		  return null;  // STUB
	  } // increment (Rational num)
	  
	  /**
	   * Decrement the given rational number. (Mutator)
	   */
	  
	  public Rational decrement (Rational num)
	  {
		  return null; // STUB
	  } // decrement (Rational num)
	  
	  /**
	   * Determine if the rational number is positive or not (Observer)
	   */
	  
	  public boolean isPositive (Rational num)
	  {
		  return false;  // STUB
	  } // isPositive (Rational num)
	  
	  
	  /**
	   * Determine if the rational number is negative or not (Observer)
	   */
	  
	  public boolean isNegative (Rational num)
	  {
		  return false; // STUB
	  } // isNegative (Rational num)
	  /**
	   * The rational number raised to the power of an integer (Observer/Mutator)
	   */
	  
	  public Rational expt (Rational num, int n)
	  {
		  return null;  // STUB
	  } // expt (Rational num, int n)
	  
	  
	  /**
	   * Get the sqrtroot of the rational number (if the square root exists)   (Observer/Constructor)
	   */
	  public Rational sqrtroot (Rational num)
	  {
		  return null; //STUB
	  } // sqrtroot (Rational num)
	  
	  
	  /**
	   * Determine if the rational number is an integer (Observer)
	   */
	  public boolean isInteger (Rational num)
	  {
		  return false; //STUB
	  } // isInteger (Rational num)
	  
	  /**
	   * 
	   * Get the average of two rational numbers (Observer/Constructor)
	   */
	  public Rational average (Rational num1, Rational num2)
	  {
		  return null; //STUB
	  } // average (Rational num)
	
	  
	  /**
	   * Construct a rational number by two integers  (Constructor)
	   */
	  
	  public Rational ConstructRational (int a, int b)
	  {
		  return null; // STUB
	  } // ConstructRational (int a, int b)
	  
	  
	  /**
	   *  Determine if two rational numbers are equal to each other  (Observer)
	   */
	  
	  public boolean equalTo (Rational num1, Rational num2)
	  {
		  return false; // STUB
	  } // equalTo (Rational num1, Rational num2)
	  
	  /**
	   * Take two rational numbers and subtract the first rational number from the second one. The output is a rational number. (Observer/Constructor)
	   */
	  
	  public Rational difference (Rational num1, Rational num2)
	  {
		  return null; //STUB
	  } // difference (Rational num1, Rational num2)
	  
}

@@ -2597,32 +2597,33 @@
  return null; //
+ 
 STUB%0A%09  %7D // dif
@@ -2661,14 +2661,727 @@
 l num2)%0A
+%0A
 %09  %0A
+%09  /**%0A%09   * Take an array of rational numbers and sort them from largerst to smallest (Mutator)%0A%09   */%0A%09  public Rational sort (Rational%5B%5D nums)%0A%09  %7B%0A%09    return null; // STUB%0A%09  %7D // sort (Rational%5B%5D nums)%0A%09  %0A%09  /**%0A%09   * Take two arrays of rational numbers and merge them into a new array (Observer/Constructor)%0A%09   */%0A%09  public Rational merge (Rational%5B%5D nums1, Rational%5B%5D nums2)%0A%09  %7B%0A%09    return null; // STUB%0A%09  %7D // merge (Rational%5B%5D nums)%0A%09  %0A%09  /**%0A%09   * Compare two arrays of rational numbers, return true if they are identical  (Observer)%0A%09   */%0A%09  public boolean compareArr (Rational%5B%5D nums1, Rational%5B%5D nums2)%0A%09  %7B%0A%09    return false; // STUB%0A%09  %7D // compareArr (Rational%5B%5D nums1, Rational%5B%5D nums2)%0A
 %7D%0A

add files to hw2