Start learning →

Match the algorithm to its average-case time complexity

Exercise and reference answers

Matching pairs
  1. Left
    Binary Search
    Right
    O(log n)
  2. Left
    Merge Sort
    Right
    O(n log n)
  3. Left
    Quick Sort
    Right
    O(n log n)
  4. Left
    Bubble Sort
    Right
    O(n²)
  5. Left
    Linear Search
    Right
    O(n)
Try this exercise with Quill →

Browse more GATE CSE questions and exercises →