Skip to main content
minor grammar fixes
Source Link
CodeNewbie
  • 11.8k
  • 2
  • 46
  • 87

slowSlow, but guaranteed to work. Ask each computer if it is working. if If it says no, then it'sit is broken, if. If it says yes, then it is working. Keep this up until you find all broken computers. This works since a working computer can never say it isn't working.

Yes it's, this is not the most efficient strategy, but figured I would point out a base case that is at least guaranteed to work at least. :)

slow but guaranteed to work. Ask each computer if it is working. if it says no then it's broken, if it says yes it is working. Keep this up until you find all broken computers. This works since a working computer can never say it isn't working.

Yes it's not the most efficient, but figured I would point out a base case that is guaranteed to work at least :)

Slow, but guaranteed to work. Ask each computer if it is working. If it says no, then it is broken. If it says yes, then it is working. Keep this up until you find all broken computers. This works since a working computer can never say it isn't working.

Yes, this is not the most efficient strategy, but figured I would point out a base case that is at least guaranteed to work. :)

Source Link
dsollen
  • 1.6k
  • 1
  • 11
  • 21

slow but guaranteed to work. Ask each computer if it is working. if it says no then it's broken, if it says yes it is working. Keep this up until you find all broken computers. This works since a working computer can never say it isn't working.

Yes it's not the most efficient, but figured I would point out a base case that is guaranteed to work at least :)