# which of the following sorting algorithm has the lowest worst case running time

### Mohammed

Guys, does anyone know the answer?

get which of the following sorting algorithm has the lowest worst case running time from screen.

## Which of the following sorting algorithms has the lowest worst

Sep 22,2022 - Which of the following sorting algorithms has the lowest worst-case complexity?a)Merge sortb)Bubble sortc)Quicksortd)Selection sortCorrect answer is option 'A'. Can you explain this answer? | EduRev Computer Science Engineering (CSE) Question is disucussed on EduRev Study Group by 35047 Computer Science Engineering (CSE) Students.

Computer Science Engineering (CSE) Question > Which of the following sorting algorithms has...

Which of the following sorting algorithms has the lowest worst-case complexity?

a) Merge sort b) Bubble sort c) Quicksort d) Selection sort

Correct answer is option 'A'. Can you explain this answer?

### Related Test

Test: Divide & Conquer- 2

### Answers

Gate Gurus Feb 17, 2022 Related

Which of the following sorting algorithms has the lowest worst-case complexity?a)Merge sortb)Bubble sortc)Quicksortd)Selection sortCorrect answer is option 'A'. Can you explain this answer?

Upvote Reply

1 Crore+ students have signed up on EduRev. Have you?

Download as PDF

### Top Courses For Computer Science Engineering (CSE)

GATE Computer Science Engineering(CSE) 2023 Mock Test Series

General Aptitude for GATE

Question Bank for GATE Computer Science Engineering

Computer Networks

Crash Course: Computer Science Engineering (CSE)

Nishant Raj Feb 09, 2020 For,

1) Bubble sort it's O(n^2).

2) Quick sort it's O(n^2). sorted in either increasing order for decreasing order sorting and vice versa.

3) Selection sort O(n^2).

4) Merge Sort everything is O(nlogn) as divide and conquer in all cases.

**Hence, Correct Answer is Option A**

**You can attempt more such questions by going through the link:**

GATE Computer Science Engineering(CSE) 2022 Mock Test Series

Upvote Reply Share with a friend Answer this doubt

### Similar Computer Science Engineering (CSE) Doubts

### CONSIDER A LIST OF RECURSIVE ALGORITHMS AND A LIST OF RECURRENCE RELATIONS ...MORE

1 Answer

### WHICH OF THE FOLLOWING IS NOT TRUE ABOUT COMPARISON BASED SORTING ALGORITHM...MORE

1 Answer

### IN THE FOLLOWING TABLE, THE LEFT COLUMN CONTAINS THE NAMES OF STANDARD GRAP...MORE

1 Answer

### CONSIDER A LIST OF RECURSIVE ALGORITHMS AND A LIST OF RECURRENCE RELATIONS ...MORE

1 Answer

### WHICH OF THE FOLLOWING IS TRUE ABOUT KRUSKAL AND PRIM MST ALGORITHMS? ASSUM...MORE

1 Answer

Question Description

Which of the following sorting algorithms has the lowest worst-case complexity?a)Merge sortb)Bubble sortc)Quicksortd)Selection sortCorrect answer is option 'A'. Can you explain this answer? for Computer Science Engineering (CSE) 2022 is part of Computer Science Engineering (CSE) preparation. The Question and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus. Information about Which of the following sorting algorithms has the lowest worst-case complexity?a)Merge sortb)Bubble sortc)Quicksortd)Selection sortCorrect answer is option 'A'. Can you explain this answer? covers all topics & solutions for Computer Science Engineering (CSE) 2022 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for Which of the following sorting algorithms has the lowest worst-case complexity?a)Merge sortb)Bubble sortc)Quicksortd)Selection sortCorrect answer is option 'A'. Can you explain this answer?.

Solutions for Which of the following sorting algorithms has the lowest worst-case complexity?a)Merge sortb)Bubble sortc)Quicksortd)Selection sortCorrect answer is option 'A'. Can you explain this answer? in English & in Hindi are available as part of our courses for Computer Science Engineering (CSE). Download more important topics, notes, lectures and mock test series for Computer Science Engineering (CSE) Exam by signing up for free.

Here you can find the meaning of Which of the following sorting algorithms has the lowest worst-case complexity?a)Merge sortb)Bubble sortc)Quicksortd)Selection sortCorrect answer is option 'A'. Can you explain this answer? defined & explained in the simplest way possible. Besides giving the explanation of Which of the following sorting algorithms has the lowest worst-case complexity?a)Merge sortb)Bubble sortc)Quicksortd)Selection sortCorrect answer is option 'A'. Can you explain this answer?, a detailed solution for Which of the following sorting algorithms has the lowest worst-case complexity?a)Merge sortb)Bubble sortc)Quicksortd)Selection sortCorrect answer is option 'A'. Can you explain this answer? has been provided alongside types of Which of the following sorting algorithms has the lowest worst-case complexity?a)Merge sortb)Bubble sortc)Quicksortd)Selection sortCorrect answer is option 'A'. Can you explain this answer? theory, EduRev gives you an ample number of questions to practice Which of the following sorting algorithms has the lowest worst-case complexity?a)Merge sortb)Bubble sortc)Quicksortd)Selection sortCorrect answer is option 'A'. Can you explain this answer? tests, examples and also practice Computer Science Engineering (CSE) tests.

## GATE

A Computer Science portal for geeks. It contains well written, well thought and well explained computer science and programming articles, quizzes and practice/competitive programming/company interview Questions.

## GATE | GATE-CS-2007 | Question 14

Last Updated : 28 Jun, 2021

Which of the following sorting algorithms has the lowest worst-case complexity?

**(A)**Merge sort

**(B)**Bubble Sort

**(C)**Quick Sort

**(D)**Selection Sort

**Answer:**

**(A)**

**Explanation:**See Question 3 of https://www.geeksforgeeks.org/data-structures-and-algorithms-set-10/

Quiz of this Question

Previous

GATE | GATE-CS-2005 | Question 37

Next

Data Structures and Algorithms | Set 10

RECOMMENDED ARTICLES

Page : 1 2 3 4 5 6

GATE | GATE CS 1999 | Question 36

04, Oct 17

GATE | GATE CS Mock 2018 | Question 39

10, Dec 17

GATE | GATE CS 2013 | Question 1

17, Oct 13

GATE | GATE CS 2013 | Question 3

17, Oct 13

GATE | GATE CS 2013 | Question 4

17, Oct 13

GATE | GATE CS 2013 | Question 65

17, Oct 13

GATE | GATE CS 2013 | Question 6

17, Oct 13

GATE | GATE CS 2013 | Question 7

17, Oct 13

GATE | GATE CS 2013 | Question 8

17, Oct 13

GATE | GATE CS 2013 | Question 65

17, Oct 13

GATE | GATE CS 2013 | Question 65

17, Oct 13

GATE | GATE CS 2013 | Question 11

17, Oct 13

GATE | GATE CS 2013 | Question 65

17, Oct 13

GATE | GATE CS 2013 | Question 17

17, Oct 13

GATE | GATE CS 2013 | Question 18

17, Oct 13

GATE | GATE CS 2013 | Question 19

17, Oct 13

GATE | GATE CS 2013 | Question 65

17, Oct 13

GATE | GATE CS 2013 | Question 65

17, Oct 13

GATE | GATE CS 2013 | Question 22

17, Oct 13

GATE | GATE CS 2013 | Question 23

17, Oct 13

GATE | GATE CS 2013 | Question 24

17, Oct 13

GATE | GATE CS 2013 | Question 25

17, Oct 13

GATE | GATE CS 2013 | Question 26

17, Oct 13

GATE | GATE CS 2013 | Question 65

17, Oct 13

Article Contributed By :

GeeksforGeeks Vote for difficulty Article Tags : GATE-CS-2007 GATE-GATE-CS-2007 GATE Report Issue

## Sorting algorithms which has the lowest worst case complexity

From the following sorting algorithms which has the lowest worst case complexity?

▲

Guys, does anyone know the answer?