public class MyAlgorithm {

  public static double findLargestDistance (Pointd[] points)
  {
    // INSERT YOUR CODE HERE:

    double diffX, diffY, dist, largest = 0.0;

    for (int i=0; i<points.length; i++) {
      for (int j=i+1; j<points.length; j++) {
        diffX = points[i].x - points[j].x;
        diffY = points[i].y - points[j].y;
        dist = Math.sqrt(diffX*diffX + diffY*diffY);
//        largest = Math.max(largest, dist);
        if (largest<dist)
          largest = dist;
      }
    }
    return largest;
  }

}