Java Gift-Wrapping Algorithm
<p>I'm taking a class titled "Data Structures and Algorithms" right now, and I'm having some trouble with Algorithm implementation. To try and gain a better understanding, I decided to try some of the Programming Exercises from our current chapter that don't have answers in the book. </p>

<p>This particular Exercise involves writing a program that prompts the user to enter the number of points in total and what the coordinates of each point are, and then using the Gift-Wrapping algorithm to find the Convex Hull. In addition, I have to use the following bit of code:</p>

<pre><code>/** Return the points that form a convex hull */
public static ArrayList&lt;MyPoint&gt; getConvexHull(double[][] s) 

"MyPoint is a static inner class defined as follows:" 

static class MyPoint {
     double x, y;

     MyPoint(double x, double y) {
          this.x = x; this.y = y;
     }
}
</code></pre>

<p>Can anyone give me an idea of where to start as far as the Algorithm itself is involved? I would also appreciate an explanation as to why.</p>

<p>Thanks!</p>
