Start learning →

Match the sorting method

Exercise and reference answers

Matching pairs
  1. Left
    Bubble sort
    Right
    Swaps unordered adjacent pairs
  2. Left
    Selection sort
    Right
    Finds the smallest each pass
  3. Left
    Insertion sort
    Right
    Places each item where it fits
  4. Left
    Linear search
    Right
    Compares every element in turn
  5. Left
    Binary search
    Right
    Compares against the middle
Instructions
Match each method on the left to how it works.

Explanation

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

Browse more IGNOU MCA questions and exercises →