From 19fadd84d8c6fdea373f1b9e4654a1b1554aee28 Mon Sep 17 00:00:00 2001
From: "Thomas (Tom) C. Gorordo" <57684088+tgorordo@users.noreply.github.com>
Date: Mon, 25 May 2026 07:40:29 -0700
Subject: [PATCH] Update README

---
 README.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/README.md b/README.md
index 611e45c..b245bb8 100644
--- a/README.md
+++ b/README.md
@@ -8,7 +8,7 @@ guaranteed the standard Condorcet i.e. Majority winner (they beat all others pai
 `smithy` identifies the Smith set via graph Strongly Connected Component (SCC) analysis of
 the pairwise majority graph using [`rustworkx`](https://www.rustworkx.org/). 
 Pairwise majority comparisons scale quadratically in the number of candidates and linearly 
-in the number of ballots, while while the SCC and condensation graph analysis is 
+in the number of ballots, while the SCC and condensation graph analysis is 
 approximately quadratic in the number of candidates for the dense tournament graphs typical 
 of Condorcet elections. Internally, repeated ballots are compressed/cache-counted before 
 pairwise evaluation to improve performance over duplicate rankings.