recursion - CLSR chip testing problem -


  Using a pair test, finding a good VLSI chip in the population of good and bad people. Chip A Chip B Conclusion ------- ------- ---------- B Good A Both are good or both are bad B is good A is the least bad one Bad is bad bad at least one bad is bad bad is bad at least one bad perception: number of goods & gt; The number of evils can be solved in the complexity of time (O) by dividing the population every half times and collecting an element of good, good pair. T (n) = t (n / 2) + n / 2 but we need 2/2 memory separately to collect pairs. Can we do these places without using additional memory ??    

The algorithm is based on the question, "Can we remove this chip?" Therefore, to remove each chip, we simply delete it from our linked list, in place (or rather, not at all).

Comments

Popular posts from this blog

mysql - BLOB/TEXT column 'value' used in key specification without a key length -

c# - Using Vici cool Storage with monodroid -

python - referencing a variable in another function? -