ISRO Computer Science (CSE) 2007 - Question 58

All ISRO Computer Science (CSE) papers | ISRO Computer Science (CSE) 2007

The Average case and worst case complexities for Merge sort algorithm are

  • A. O(n²), O(n²)
  • B. O(n²), O(n log n)
  • C. O(n log n), O(n²)
  • D. O(n log n), O(n log n)

Answer: D. O(n log n), O(n log n)

Explanation: Merge sort is consistently O(n log n).

| | All questions of ISRO Computer Science (CSE) 2007