Question

1. Submit a Screenshot with a visible operating system data/time with the primary code in your IDE and the compilation results. 2. Submit the code required by My Programming Lab. Chapter 16 MyProgrammingLab Exercise 20776 Assume the existence of a Widget class that implements the Comparable interface and thus has a compareTo method that accepts an Objectparameter and returns an int. Write an efficient static method, getWidgetMatch, that has two parameters. The first parameter is a reference to a Widget object. The second parameter is a potentially very large array of Widget objects that has been sorted in ascending order based on the Widget compareTo method. The getWidgetMatch searches for an element in the array that matches the first parameter on the basis of the equalsmethod and returns true if found and false otherwise.

Answer 1

class Widget implements Comparable

{

   // variables for name and price
   private String name;

   private double price;

   /**
   * default constructor
   */
   public Widget()

   {

       name = "";

       price = 0.0;

   }

   /**
   * @param n
   * @param p
   * to initialiaze the values for name and prices of the widget
   */
   public Widget(String n, double p)

   {

       name = n;

       price = p;

   }
  

   /**
   * @return name of the widget
   */
   public String getName()

   {

       return name;

   }
   /**
   * @param sets name of the widget
   */
   public void setName(String n)

   {

       name = n;

   }
   /**
   * @return price of the widget
   */
   public double getPrice()

   {

       return price;

   }
   /**
   * @param sets the price of the widget
   */
   public void setPrice(double p)

   {

       price = p;

   }
  

   /* (non-Javadoc)
   * @see java.lang.Object#toString()
   * returns name and price of the widget
   */
   public String toString()

   {

       return "Name: " + name + ", Price: $" + String.format("%.2f", price);

   }

   // this method comparing the widgets based on the name
   // so when we put these in collections sorting will be based on name of the widget
   public int compareTo(Object obj)

   {

       Widget other = (Widget) obj;

       if (this.name.compareTo(other.name) < 0)

           return -1;

       else if (this.name.compareTo(other.name) > 0)

           return 1;

       else

           return 0;

   }

   // checking the equlaity of widgets based on the name
   public boolean equals(Object obj)

   {

       Widget other = (Widget) obj;

       return this.compareTo(other) == 0;

   }
  
   // this is finding the widget in the given array using the binary search
   public static boolean getWidgetMatch(Widget widget, Widget[] widArr)

   {

       int first = 0;

       int last = widArr.length - 1;
       // loop untill first reaches last
       while (first <= last)

       {

           // findin the middle position
           int middle = (first + last) / 2;

           // if it is in the middle return true
           if (widArr[middle].equals(widget))

               return true;
           // if is less than middle than search only left side of the array
           if (widArr[middle].compareTo(widget) < 0)

               first = middle + 1;
           // search right side of the array
           else

               last = middle - 1;

       }

       return false;

   }

}//end of class

public class WidgetTest

{

   public static void main(String[] args)

   {

       //creating the widget class array of 5
       Widget[] widArr = new Widget[5];

       //creating 5 objects and putting them in the array
       widArr[0] = new Widget("Koti", 253);

       widArr[1] = new Widget("Smith", 158);

       widArr[2] = new Widget("Warden", 389);

       widArr[3] = new Widget("Perl", 219);

       widArr[4] = new Widget("Uttam",454);
       //sorting the array of obejcts

       for (int i = 0; i < widArr.length - 1; i++) {

           int minPos = i;
           //finding the min element from the array
           for (int j = i + 1; j < widArr.length; j++) {

               if (widArr[j].compareTo(widArr[minPos]) < 0)

                   minPos = j;

           }

           //swapping with the starting elements
           if (minPos != i) {

               Widget temp = widArr[i];

               widArr[i] = widArr[minPos];

               widArr[minPos] = temp;

           }

       }

       //printing array after sorting
       System.out.println("Array of widgets:");

       for (int i = 0; i < widArr.length; i++)

           System.out.println("\t" + widArr[i]);

       System.out.println();

       // finding the widget from the array
       Widget widget = new Widget("Uday", 159);

       if (Widget.getWidgetMatch(widget, widArr))

           System.out.println("Widget '" + widget.getName() + "' is found in the array of widgets.");

       else

           System.out.println("Widget '" + widget.getName() + "' is not found in the array of widgets.");

   }

}

//creating the widget class array of 5 173 174 175 176 Widget widArrnew Widget[5]; //creating 5 objects and putting them in the array 178 179 180 181 182 183 184 185 186 187 188 widArr[0]new Widget ("Koti", 253); widArr[1] -new Widget("Smith", 158); widArr[2]new Widget ("Warden", 389); widArr[3]-new Widget("Perl", 219); widArr[4]new Widget("Uttam" ,454); //sorting the array of obeists for (int i 0; i < widArr.length - 1; i++) ( <terminated> WidgetTest Java Application] C:Soft\PegaEclipse-win64-4.5.2.2PegaEclipse-win64-4.5.2.2eclipse\plugins) com.pega.pep.oracle.java8x64 1.8.0.45 java binavaw.xe (Apr 1, 2019, 7:56:37 AM) Array of widgets: Console X Name: Koti, Price: $253.00 Name: Perl, Price: $219.00 Name Smith, Price: $158.00 Name: Uttam, Price: $454.00 Name: Warden, Price: $389.00 Widget 'Uday' is not found in the array of widgets