Re: What is Data Model FOR?

From: Douglas W. Jones <jones_at_cs_dot_uiowa_dot_edu>
Date: Thu Apr 29 2004 - 18:14:11 CDT

On Apr 29, 2004, at 1:10 PM, Alan Dechert wrote:

> The unordered combinations of n things taken k at a time is given by
> n!/(k! * (n-k)!)

One of my favorite drafts of the FEC/NASED 2002 voting system standards
actually required that there be separate counters in an N-way race for
each possible combinations of N candidates. This required 2**N
counters.
Just imagine carrying out a county board race with 20 candidates.
You'd
need 4 meg of memory just to count that race. Lovely.

                Doug
==================================================================
= The content of this message, with the exception of any external
= quotations under fair use, are released to the Public Domain
==================================================================
Received on Fri Apr 30 23:17:25 2004

This archive was generated by hypermail 2.1.8 : Fri Apr 30 2004 - 23:17:29 CDT