|
|
|
|
|
|
by udev
1337 days ago
|
|
|
The 48 DIMMs problem is not so bad... Remember those problems where you are given n gold coins (among which one is fake) and a balance, and the task is to find the minimal number of weighting operations to identify the fake coin. So, you go binary search looking for the borked DIMM, load 24 DIMMs see if it crashes, if no crash -> the borked DIMM is in the other pile, rinse and repeat... |
|
|