algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-07-26 05:59:22 +08:00
Code Issues Packages Projects Releases Wiki Activity

Fixed some typos and links for javadoc, and some refactoring (#4755)

Browse Source
This commit is contained in:
Ayoub Chegraoui
2023-10-15 15:02:24 +01:00
committed by GitHub
parent 48ae88f09d
commit 8002137b76
5 changed files with 10 additions and 12 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
src/main/java/com/thealgorithms/geometry/GrahamScan.java
View File

@ -6,7 +6,7 @@ import java.util.Stack;
/*
* A Java program that computes the convex hull using the Graham Scan algorithm
* In the best case, time complexity is O(n), while in the worst case, it is log(n).
* In the best case, time complexity is O(n), while in the worst case, it is O(nlog(n)).
* O(n) space complexity
*
* This algorithm is only applicable to integral coordinates.
@ -106,16 +106,14 @@ public class GrahamScan {
/**
* @param p2 Co-ordinate of point to compare to.
* This function will compare the points and will return a positive integer it the
* This function will compare the points and will return a positive integer if the
* point is greater than the argument point and a negative integer if the point is
* less than the argument point.
*/
public int compareTo(Point p2) {
if (this.y < p2.y) return -1;
if (this.y > p2.y) return +1;
if (this.x < p2.x) return -1;
if (this.x > p2.x) return +1;
return 0;
int res = Integer.compare(this.y, p2.y);
if (res == 0) res = Integer.compare(this.x, p2.x);
return res;
}
/**