General Discussion

eppur_se_muova

(37,996 posts)

7. When vote counts are done heirarchically, the process time should be O(log n), not O(n).

Wed Nov 20, 2024, 08:54 PM

Nov 20

Small batches are counted, then the totals sent for a second totaling. Those results are then sent for a third total, if need be. The time required to count depends on the number counted in each small batch, and the number of levels in the heirarchy. Increasing the number of votes several fold should add one step to the heirarchy, increasing the time by a fraction (maybe a large fraction, like 1/3 if there were three levels to begin with) but much, much less than a doubling.

Elections can be fast or accurate, but the latter is more important. The large number of ballots is not an insuperable obstacle.

Edit history

Please sign in to view edit histories.

Recommendations

2 members have recommended this reply (displayed in chronological order):

Meowmee questionseverything

11 replies

= new reply since forum marked as read

Highlight:

Did you know most of Europe hand counts their paper ballots? [View all] questionseverything Nov 20 OP

Did you know most of Europe's ballots have but a single race? Fiendish Thingy Nov 20 #1

We have more than 4 times as many people as any country that actually votes in europe JT45242 Nov 20 #2

When vote counts are done heirarchically, the process time should be O(log n), not O(n). eppur_se_muova Nov 20 #7

because other than France those countries don't elect dsc Nov 20 #3

And their ballots are quite different. Igel Nov 20 #4

I remember myself and two other union Emile Nov 20 #5

Kick for new points questionseverything Nov 20 #6

The thing is, snot Nov 20 #8

Counting one race precinct by precinct should take a few hours not days questionseverything Nov 20 #9

In my county there are multiple precincts at each polling place. LiberalFighter Nov 20 #10

We are only talking about hand counting the presidential race for this discussion questionseverything Nov 20 #11