Searching algorithms common mistakes

Common mistakes

• Stopping too soon when a value is absent

  Reporting that the target is absent after checking only some of the list.

  Fix itContinue checking every remaining item unless a matching target is found. Absence can be reported only after the list has been fully examined.

• Using binary search on unordered data

  Applying binary search without checking that the data is ordered.

  Fix itEnsure the data is ordered first, because binary search relies on the order to decide which half to discard.

• Starting at the wrong node

  Beginning the trace with a child node instead of the root.

  Fix itAlways record and compare the root value first, then follow the branch selected by the comparison.