Start learning →

Order one binary search step

Exercise and reference answers

Steps
  1. Take the sorted list
  2. Find its middle element
  3. Compare it with the key
  4. Discard the wrong half
  5. Repeat on the half that is left
Instructions
Tap the actions in the order binary search performs them.

Explanation

_Source: syllabus Computer Science, Ch 5 'Sorting' and Ch 6 'Searching'_
Continue learning with Quill →

Browse more IGNOU MCA questions and exercises →