From 88c8e3935cf21dc97afc0298b519b0f19db3eeec Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?L=C3=AA=20Nam=20Kh=C3=A1nh?=
 <55955273+khanhkhanhlele@users.noreply.github.com>
Date: Wed, 5 Nov 2025 17:31:34 +0700
Subject: [PATCH] chore: fix typos in
 src/main/java/com/thealgorithms/divideandconquer/ClosestPair.java (#7034)

Fix typos in src/main/java/com/thealgorithms/divideandconquer/ClosestPair.java

Co-authored-by: a <19151554+alxkm@users.noreply.github.com>
---
 .../java/com/thealgorithms/divideandconquer/ClosestPair.java    | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/src/main/java/com/thealgorithms/divideandconquer/ClosestPair.java b/src/main/java/com/thealgorithms/divideandconquer/ClosestPair.java
index cd26f9213..4c9c40c83 100644
--- a/src/main/java/com/thealgorithms/divideandconquer/ClosestPair.java
+++ b/src/main/java/com/thealgorithms/divideandconquer/ClosestPair.java
@@ -182,7 +182,7 @@ public final class ClosestPair {
 
         double minLeftArea; // Minimum length of left array
         double minRightArea; // Minimum length of right array
-        double minValue; // Minimum lengt
+        double minValue; // Minimum length
 
         minLeftArea = closestPair(leftArray, divideX); // recursive closestPair
         minRightArea = closestPair(rightArray, indexNum - divideX);