The GATE Grind

GATE 2007 CS – Question 14

Algorithms · Searching, Sorting and Hashing · 1 mark · Multiple choice

Which sort has lowest worst-case complexity?

  1. Merge sort
  2. Bubble sort
  3. Quicksort
  4. Selection sort

Practise this question in The GATE Grind →

Show answer and explanation

Correct answer: (A) Merge sort

Explanation

We are sorry we couldn't write detailed soluition for this, we are working on it!, please consider asking your own AI, its just 2-3 clicks with very minimum effort

More Searching, Sorting and Hashing questions

All Searching, Sorting and Hashing questions →