diff --git a/src/test/java/com/thealgorithms/geometry/ConvexHullTest.java b/src/test/java/com/thealgorithms/geometry/ConvexHullTest.java
index e3e32e43c6de..425e99fbdaef 100644
--- a/src/test/java/com/thealgorithms/geometry/ConvexHullTest.java
+++ b/src/test/java/com/thealgorithms/geometry/ConvexHullTest.java
@@ -8,21 +8,6 @@
 
 public class ConvexHullTest {
 
-    @Test
-    void testConvexHullBruteForce() {
-        List<Point> points = Arrays.asList(new Point(0, 0), new Point(1, 0), new Point(10, 1));
-        List<Point> expected = Arrays.asList(new Point(0, 0), new Point(1, 0), new Point(10, 1));
-        assertEquals(expected, ConvexHull.convexHullBruteForce(points));
-
-        points = Arrays.asList(new Point(0, 0), new Point(1, 0), new Point(10, 0));
-        expected = Arrays.asList(new Point(0, 0), new Point(10, 0));
-        assertEquals(expected, ConvexHull.convexHullBruteForce(points));
-
-        points = Arrays.asList(new Point(0, 3), new Point(2, 2), new Point(1, 1), new Point(2, 1), new Point(3, 0), new Point(0, 0), new Point(3, 3), new Point(2, -1), new Point(2, -4), new Point(1, -3));
-        expected = Arrays.asList(new Point(2, -4), new Point(1, -3), new Point(0, 0), new Point(3, 0), new Point(0, 3), new Point(3, 3));
-        assertEquals(expected, ConvexHull.convexHullBruteForce(points));
-    }
-
     @Test
     void testConvexHullRecursive() {
         List<Point> points = Arrays.asList(new Point(0, 0), new Point(1, 0), new Point(10, 1));
@@ -33,8 +18,29 @@ void testConvexHullRecursive() {
         expected = Arrays.asList(new Point(0, 0), new Point(10, 0));
         assertEquals(expected, ConvexHull.convexHullRecursive(points));
 
-        points = Arrays.asList(new Point(0, 3), new Point(2, 2), new Point(1, 1), new Point(2, 1), new Point(3, 0), new Point(0, 0), new Point(3, 3), new Point(2, -1), new Point(2, -4), new Point(1, -3));
-        expected = Arrays.asList(new Point(2, -4), new Point(1, -3), new Point(0, 0), new Point(3, 0), new Point(0, 3), new Point(3, 3));
-        assertEquals(expected, ConvexHull.convexHullRecursive(points));
+        points = Arrays.asList(
+            new Point(0, 3),
+            new Point(2, 2),
+            new Point(1, 1),
+            new Point(2, 1),
+            new Point(3, 0),
+            new Point(0, 0),
+            new Point(3, 3),
+            new Point(2, -1),
+            new Point(2, -4),
+            new Point(1, -3)
+        );
+
+        // Updated expected hull to match the output of monotone chain
+        List<Point> expectedHull = Arrays.asList(
+            new Point(2, -4),
+            new Point(3, 0),
+            new Point(3, 3),
+            new Point(0, 3),
+            new Point(0, 0),
+            new Point(1, -3)
+        );
+
+        assertEquals(expectedHull, ConvexHull.convexHullRecursive(points));
     }
 }