GATE CS 2016 Question 25: Worst Case Time Complexity of Sorting Algorithms

```

Computer Sciences > Gate 2016 Set-1 > Complexity

The worst case running times of Insertion sort, Merge sort and Quick sort, respectively, are:

A

Θ(n log n), Θ(n log n) and Θ(n²)

B

Θ(n²), Θ(n²2) and Θ(n Log n)

C

Θ(n²), Θ(n log n) and Θ(n log n)

D

Θ(n²), Θ(n log n) and Θ(n²)

Correct : Complexity

Similar Questions

Match the algorithms with their time complexities: Algorithm Time Complexity (P)Tower of Hanoi with n disks (i)...

#169 MCQ

Match the algorithms with their time complexities: Algorithm Time Complexity (P)Tower of Hanoi with n disks (i)...

#169 MCQ

Match the algorithms with their time complexities: Algorithm Time Complexity (P)Tower of Hanoi with n disks (i)...

#169 MCQ

Related Topics

No tags found

Unique Visitor Count

Total Unique Visitors

Loading......