LIVE Course for free

Rated by 1 million+ students
Get app now
JEE MAIN 2023
JEE MAIN 2023 TEST SERIES
NEET 2023 TEST SERIES
NEET 2023
CLASS 12 FOUNDATION COURSE
CLASS 10 FOUNDATION COURSE
CLASS 9 FOUNDATION COURSE
CLASS 8 FOUNDATION COURSE
0 votes
133 views
in Computer by (71.8k points)
closed by

Assume that the algorithms considered here sort the input sequences in ascending order. If the input is already in ascending order, which of the following are TRUE? 

I. Quick sort runs in Θ(n2) time 

II. Bubble sort runs in Θ(n2) time

III. Merge sort runs in Θ(n) time 

IV. Insertion sort runs in Θ(n) time 

(A) I and II only 

(B) I and III only 

(C) II and IV only 

(D) I and IV only

1 Answer

+1 vote
by (70.9k points)
selected by
 
Best answer

Correct option is (D) I and IV only

As input is already sorted quick sort runs in θ(n2) & insertion sort runs in θ(n).

Welcome to Sarthaks eConnect: A unique platform where students can interact with teachers/experts/students to get solutions to their queries. Students (upto class 10+2) preparing for All Government Exams, CBSE Board Exam, ICSE Board Exam, State Board Exam, JEE (Mains+Advance) and NEET can ask questions from any subject and get quick answers by subject teachers/ experts/mentors/students.

Categories

...