**Highest** { best-case runtime (for that algorithm!) } complexity is the one which **takes the longest time to complete**. The question wants you to find the highest, which is the slowest algorithm from the options. So, it is obviously it is $O(n^2)$.

The Gateway to Computer Science Excellence

0 votes

Which of the below given sorting techniques has highest best-case runtime complexity.

**(A)** Quick sort

**(B)** Selection sort

**(C)** Insertion sort

**(D)** Bubble sort

**Answer:** **(B)**

**Explanation:**

Quick sort best case time complexity is Ο(n logn)

Selection sort best case time complexity is Ο(n^2 )

Insertion sort best case time complexity is Ο(n)

Bubble sort best case time complexity is Ο(n)

Source: GeeksforGeeks

https://www.geeksforgeeks.org/gate-gate-mock-2017-question-12/

I did not understand this as best case time should be O(n) sorting method what does highest best cases mean?

- All categories
- General Aptitude 1.9k
- Engineering Mathematics 7.5k
- Digital Logic 2.9k
- Programming and DS 4.9k
- Algorithms 4.4k
- Theory of Computation 6.2k
- Compiler Design 2.1k
- Databases 4.1k
- CO and Architecture 3.4k
- Computer Networks 4.2k
- Non GATE 1.4k
- Others 1.4k
- Admissions 595
- Exam Queries 573
- Tier 1 Placement Questions 23
- Job Queries 72
- Projects 18

50,737 questions

57,291 answers

198,209 comments

104,892 users