tgorordo/smithy
1
0
Fork 0
mirror of https://github.com/tgorordo/smithy.git synced 2026-06-05 16:22:15 -07:00
Code Issues Projects Releases Packages Wiki Activity Actions

Update README

Browse source
This commit is contained in:
Thomas (Tom) C. Gorordo 2026-05-25 00:30:32 -07:00 • committed by GitHub
parent 5d0f1da322
commit dd0b306c1e
No known key found for this signature in database
GPG key ID: B5690EEEBB952194
1 changed files with 1 additions and 1 deletions
Download patch file Download diff file Expand all files Collapse all files

2
README.md
View file

@ -7,7 +7,7 @@ guaranteed the standard Condorcet i.e. Majority winner (they beat all others pai
`smithy` currently identifies the set by brute-force search which is combinatoric complexity `smithy` currently identifies the set by brute-force search which is combinatoric complexity
in the worst case (TODO: better [algorithm](https://en.wikipedia.org/wiki/Floyd%E2%80%93Warshall_algorithm)) in the worst case (TODO: better [algorithm](https://en.wikipedia.org/wiki/Floyd%E2%80%93Warshall_algorithm))
but appears approximately $O(n^2)$ on-average in the number of candidates for typical/random ballots, but appears approximately O(n^2) on-average in the number of candidates for typical/random ballots,
and linear in the number of ballots. and linear in the number of ballots.