Accumulating Information
Accumulating Information
- 2n-2 bits of information are required to solve the problem
- All keys except one must lose, all keys except one must win
- Comparing N,N pairs gives n/2 comparisons and n bits of info
- n-2 additional bits are required
- one comparison each is needed